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:09Josu San MartinJosu San MartinScore: 65,840Success
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:1065,777556,784,371487,790,00058,160,0002,113,536
2May 10, 2026 13:1065,830556,102,692487,950,00058,440,0002,113,536
3May 10, 2026 13:1065,839555,393,901487,891,00058,573,0002,113,536
4May 10, 2026 13:1065,839556,075,039487,741,00058,730,0002,113,536
5May 10, 2026 13:1065,840555,294,414487,929,00058,545,0002,113,536
6May 10, 2026 13:1065,840558,257,710487,969,00058,510,0002,113,536
7May 10, 2026 13:1065,888556,244,296487,963,00058,910,0002,113,536
8May 10, 2026 13:1065,910557,068,403487,659,00059,401,0002,113,536
9May 10, 2026 13:1065,917557,634,191488,040,00059,076,0002,113,536