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 5, 2026 14:29M-RochatM-RochatScore: 22,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 14:3122,367200,481,316184,511,0001,140,0002,486,272
2May 5, 2026 14:3122,527207,720,947185,806,0001,174,0002,473,984
3May 5, 2026 14:3122,542203,627,075185,941,0001,159,0002,465,792
4May 5, 2026 14:3122,543205,822,306185,900,0001,208,0002,478,080
5May 5, 2026 14:3122,545202,110,009185,969,0001,156,0002,478,080
6May 5, 2026 14:3122,572203,942,611186,155,0001,198,0002,465,792
7May 5, 2026 14:3122,627206,125,321186,602,0001,204,0002,461,696
8May 5, 2026 14:3122,635204,981,839186,726,0001,149,0002,469,888
9May 5, 2026 14:3122,881207,515,270188,759,0001,154,0002,469,888