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 11, 2026 13:36wnwnScore: 4,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 13:294,20361,400,40032,892,0001,993,0002,277,376
2Apr 11, 2026 13:294,21157,143,97132,954,0001,997,0002,531,328
3Apr 11, 2026 13:364,22967,548,32533,098,0002,005,0002,277,376
4Apr 11, 2026 13:364,26554,947,12334,392,0001,011,0002,490,368
5Apr 11, 2026 13:364,27861,763,51434,494,0001,014,0002,277,376
6Apr 11, 2026 13:294,28155,289,08234,520,0001,015,0002,277,376