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 20, 2026 10:25M-RochatM-RochatScore: 6,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:266,85266,272,06054,805,0002,068,0002,113,536
2May 20, 2026 10:266,88267,808,57355,069,0002,055,0002,113,536
3May 20, 2026 10:266,95467,516,04955,568,0002,156,0002,113,536
4May 20, 2026 10:266,95870,483,57355,582,0002,176,0002,113,536
5May 20, 2026 10:266,95967,224,58955,591,0002,174,0002,113,536
6May 20, 2026 10:266,97268,081,26155,594,0002,276,0002,113,536
7May 20, 2026 10:266,97867,903,92655,760,0002,165,0002,113,536
8May 20, 2026 10:266,98067,980,40355,767,0002,170,0002,113,536
9May 20, 2026 10:267,00169,408,82355,831,0002,280,0002,113,536