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 listApr 29, 2026 13:03olliecrowolliecrowScore: 8,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:047,99082,764,74261,298,0005,024,0002,408,448
2Apr 29, 2026 13:048,06383,366,80063,927,0002,996,0002,314,240
3Apr 29, 2026 13:048,09083,873,48765,150,0002,004,0002,351,104
4Apr 29, 2026 13:048,09785,749,32764,198,0003,009,0002,469,888
5Apr 29, 2026 13:048,10888,344,03862,278,0005,022,0002,514,944
6Apr 29, 2026 13:048,11389,661,12762,314,0005,025,0002,318,336
7Apr 29, 2026 13:048,13785,341,00664,520,0003,024,0002,469,888
8Apr 29, 2026 13:048,18687,967,41264,952,0002,997,0002,494,464
9Apr 29, 2026 13:049,65699,307,13478,142,0002,003,0002,441,216