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 listNov 3, 2026 03:58Andrew EpsteinAndrew EpsteinScore: 88,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 03:5888,063740,340,860728,921,0002,010,0002,121,728stderr
2Nov 3, 2026 03:5888,530744,539,734732,797,0002,004,0002,121,728stderr
3Nov 3, 2026 03:5888,531744,160,699731,710,0003,102,0002,121,728stderr
4Nov 3, 2026 03:5888,729746,227,027734,432,0002,019,0002,121,728stderr
5Nov 3, 2026 03:5888,884747,508,067735,697,0002,042,0002,121,728stderr
6Nov 3, 2026 03:5888,948747,773,750735,004,0003,268,0002,121,728stderr
7Nov 3, 2026 03:5888,960747,912,814736,340,0002,029,0002,121,728stderr
8Nov 3, 2026 03:5889,076748,704,201737,294,0002,040,0002,121,728stderr
9Nov 3, 2026 03:5889,117749,115,247737,640,0002,037,0002,121,728stderr