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 22, 2026 23:53M-RochatM-RochatScore: 6,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:536,55566,467,06353,399,0001,015,0002,113,536
2May 22, 2026 23:536,56265,884,51153,454,0001,015,0002,113,536
3May 22, 2026 23:536,56266,831,09753,453,0001,015,0002,113,536
4May 22, 2026 23:536,56765,607,95653,485,0001,029,0002,113,536
5May 22, 2026 23:536,59665,733,08453,739,0001,016,0002,113,536
6May 22, 2026 23:536,61166,209,50453,857,0001,016,0002,113,536
7May 22, 2026 23:536,62665,862,46653,984,0001,015,0002,113,536
8May 22, 2026 23:536,63364,738,32254,039,0001,016,0002,113,536
9May 22, 2026 23:536,69265,607,78954,528,0001,016,0002,113,536