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 13:45Josu San MartinJosu San MartinScore: 4,221Success
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 13:454,19345,408,71333,764,0001,039,0002,113,536
2May 10, 2026 13:454,19543,466,91033,785,0001,035,0002,113,536
3May 10, 2026 13:454,20745,331,23333,883,0001,043,0002,113,536
4May 10, 2026 13:454,20843,063,08733,874,0001,059,0002,113,536
5May 10, 2026 13:454,22142,257,56633,994,0001,042,0002,113,536
6May 10, 2026 13:454,25844,816,41834,315,0001,030,0002,113,536
7May 10, 2026 13:454,26543,057,90334,351,0001,053,0002,113,536
8May 10, 2026 13:454,32943,515,98034,869,0001,068,0002,113,536
9May 10, 2026 13:454,34045,338,32234,986,0001,038,0002,113,536