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 20:16Daniel MastalerzDaniel MastalerzScore: 5,486Success
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 20:165,40073,164,67741,830,0002,987,0002,314,240
2Feb 24, 2026 20:165,41866,666,30240,969,0003,997,0002,514,944
3Feb 24, 2026 20:165,48075,176,24642,449,0003,032,0002,326,528
4Feb 24, 2026 20:165,48266,690,98542,470,0003,033,0002,318,336
5Feb 24, 2026 20:165,48674,691,65743,509,0002,023,0002,306,048
6Feb 24, 2026 20:165,49775,677,71042,584,0003,041,0002,265,088
7Feb 24, 2026 20:165,52268,632,86641,845,0003,985,0002,326,528
8Feb 24, 2026 20:165,53277,796,28641,921,0003,992,0002,269,184
9Feb 24, 2026 20:165,54968,148,69342,055,0004,005,0002,326,528