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 listMay 22, 2026 07:17Victor MerckléVictor MerckléScore: 4,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 07:184,58946,169,71537,017,0001,075,0002,113,536
2May 22, 2026 07:184,59447,759,99437,076,0001,061,0002,113,536
3May 22, 2026 07:184,60346,045,11637,142,0001,063,0002,113,536
4May 22, 2026 07:184,62246,218,29237,347,0001,020,0002,113,536
5May 22, 2026 07:184,63250,093,47737,447,0001,003,0002,113,536
6May 22, 2026 07:184,63246,887,66937,451,0001,002,0002,113,536
7May 22, 2026 07:184,63546,312,34437,469,0001,003,0002,113,536
8May 22, 2026 07:184,67849,895,61137,763,0001,070,0002,113,536
9May 22, 2026 07:185,07350,142,20841,085,0001,025,0002,113,536