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 11, 2026 01:42Josu San MartinJosu San MartinScore: 3,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 01:423,87442,071,88531,054,0001,102,0002,113,536
2May 11, 2026 01:423,88540,117,88831,171,0001,082,0002,113,536
3May 11, 2026 01:423,88740,979,35131,145,0001,119,0002,113,536
4May 11, 2026 01:423,88740,391,13131,193,0001,075,0002,113,536
5May 11, 2026 01:423,89742,314,88131,275,0001,072,0002,113,536
6May 11, 2026 01:423,91240,891,32331,388,0001,084,0002,113,536
7May 11, 2026 01:423,91442,192,06731,385,0001,106,0002,113,536
8May 11, 2026 01:423,95040,493,55731,699,0001,088,0002,113,536
9May 11, 2026 01:423,95440,514,08631,750,0001,076,0002,113,536