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 24, 2026 15:05Charles CabergsCharles CabergsScore: 19,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 15:0519,886181,504,152164,057,0001,000,0002,371,584
2Apr 24, 2026 15:0519,914179,672,128164,291,0001,001,0002,293,760
3Apr 24, 2026 15:0519,922181,314,001164,353,0001,002,0002,367,488
4Apr 24, 2026 15:0519,926179,409,491164,386,0001,002,0002,367,488
5Apr 24, 2026 15:0519,934184,624,421163,464,0001,993,0002,367,488
6Apr 24, 2026 15:0519,944180,918,071164,538,0001,003,0002,371,584
7Apr 24, 2026 15:0520,685187,950,670169,691,0001,996,0002,306,048
8Apr 24, 2026 15:0520,685189,096,524169,690,0001,996,0002,371,584
9Apr 24, 2026 15:0520,702190,005,195169,831,0001,998,0002,371,584