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 12, 2026 01:02Josu San MartinJosu San MartinScore: 4,115Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:034,09442,653,43132,906,0001,075,0002,113,536
2May 12, 2026 01:034,09642,800,98532,921,0001,083,0002,113,536
3May 12, 2026 01:034,10843,537,82633,030,0001,072,0002,113,536
4May 12, 2026 01:034,10942,610,56533,026,0001,082,0002,113,536
5May 12, 2026 01:034,11541,781,74832,991,0001,165,0002,113,536
6May 12, 2026 01:034,18442,057,03933,664,0001,071,0002,113,536
7May 12, 2026 01:034,18543,968,07833,660,0001,083,0002,113,536
8May 12, 2026 01:034,19944,395,76833,772,0001,085,0002,113,536
9May 12, 2026 01:034,20543,792,07533,827,0001,076,0002,113,536