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 13, 2026 23:02Victor MerckléVictor MerckléScore: 7,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 23:027,67271,188,45363,683,00002,113,536
2May 13, 2026 23:027,67573,389,94763,710,00002,113,536
3May 13, 2026 23:027,67572,704,40663,709,00002,113,536
4May 13, 2026 23:027,67572,541,43663,706,00002,113,536
5May 13, 2026 23:027,67672,388,63663,718,00002,113,536
6May 13, 2026 23:027,67873,792,36563,730,00002,113,536
7May 13, 2026 23:027,68072,891,66762,732,0001,014,0002,113,536
8May 13, 2026 23:027,68271,026,03962,724,0001,042,0002,113,536
9May 13, 2026 23:027,69074,132,40862,786,0001,043,0002,113,536