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 listSep 16, 2026 23:53Andrew EpsteinAndrew EpsteinScore: 4,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 23:534,14244,548,93933,271,0001,113,0002,113,536
2Sep 16, 2026 23:534,18844,893,05833,640,0001,126,0002,113,536
3Sep 16, 2026 23:534,18844,943,98033,651,0001,110,0002,113,536
4Sep 16, 2026 23:534,25345,509,99034,195,0001,113,0002,113,536
5Sep 16, 2026 23:534,25645,447,87634,206,0001,121,0002,113,536
6Sep 16, 2026 23:534,26745,574,58734,299,0001,122,0002,113,536
7Sep 16, 2026 23:534,28045,627,47134,397,0001,129,0002,113,536
8Sep 16, 2026 23:534,28745,768,20534,511,0001,078,0002,113,536
9Sep 16, 2026 23:534,29646,995,46734,551,0001,114,0002,113,536