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 listAug 12, 2026 16:20Victor MerckléVictor MerckléScore: 4,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 16:204,23343,643,26434,013,0001,123,0002,117,632stderr
2Aug 12, 2026 16:204,25643,559,25434,289,0001,039,0002,117,632stderr
3Aug 12, 2026 16:204,28045,261,92634,469,0001,063,0002,117,632stderr
4Aug 12, 2026 16:204,29844,101,69534,627,0001,052,0002,117,632stderr
5Aug 12, 2026 16:204,31144,284,26334,736,0001,046,0002,117,632stderr
6Aug 12, 2026 16:204,35644,553,62535,033,0001,127,0002,117,632stderr
7Aug 12, 2026 16:204,40745,024,66335,534,0001,052,0002,117,632stderr
8Aug 12, 2026 16:204,48145,580,37336,142,0001,054,0002,117,632stderr
9Aug 12, 2026 16:205,17651,414,06341,825,0001,143,0002,117,632stderr