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 listMay 10, 2026 01:45Josu San MartinJosu San MartinScore: 4,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 01:454,68255,163,74037,808,0001,058,0002,473,984
2May 10, 2026 01:454,68355,000,59937,780,0001,089,0002,473,984
3May 10, 2026 01:454,69956,988,88537,782,0001,225,0002,469,888
4May 10, 2026 01:454,70554,116,11537,946,0001,112,0002,478,080
5May 10, 2026 01:454,73953,250,00938,157,0001,177,0002,469,888
6May 10, 2026 01:454,74056,670,58038,155,0001,193,0002,469,888
7May 10, 2026 01:454,74955,636,62338,364,0001,053,0002,473,984
8May 10, 2026 01:454,77254,478,67238,532,0001,077,0002,473,984
9May 10, 2026 01:455,03557,055,19440,719,0001,077,0002,469,888