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 19:28Josu San MartinJosu San MartinScore: 3,887Success
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 19:283,87442,116,51231,075,0001,082,0002,113,536
2May 10, 2026 19:283,87539,870,11731,060,0001,104,0002,113,536
3May 10, 2026 19:283,87739,548,55831,093,0001,090,0002,113,536
4May 10, 2026 19:283,88439,725,43331,156,0001,089,0002,113,536
5May 10, 2026 19:283,88739,934,68731,186,0001,083,0002,113,536
6May 10, 2026 19:283,88941,499,60731,201,0001,081,0002,113,536
7May 10, 2026 19:283,89139,805,29431,228,0001,071,0002,113,536
8May 10, 2026 19:283,94340,399,76731,647,0001,086,0002,113,536
9May 10, 2026 19:283,95340,015,66031,729,0001,084,0002,113,536