Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 24, 2026 21:15Mikołaj UzarskiMikołaj UzarskiScore: 6,368Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 21:156,36076,707,65950,800,0001,992,0002,281,472
2Feb 24, 2026 21:156,36084,956,00050,799,0001,992,0002,514,944
3Feb 24, 2026 21:156,36579,437,54350,837,0001,993,0002,510,848
4Feb 24, 2026 21:156,36874,546,89850,859,0001,994,0002,281,472
5Feb 24, 2026 21:156,36879,165,18051,838,0001,016,0002,281,472
6Feb 24, 2026 21:156,37085,043,66250,879,0001,995,0002,510,848
7Feb 24, 2026 21:156,38478,734,37550,991,0001,999,0002,510,848
8Feb 24, 2026 21:156,40176,513,66351,121,0002,004,0002,502,656
9Feb 24, 2026 21:156,40883,621,44450,178,0003,010,0002,502,656