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 listAug 5, 2026 22:31TonyTonyScore: 8,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 22:328,61081,295,07668,787,0002,682,0002,113,536
2Aug 5, 2026 22:328,62181,445,67468,925,0002,633,0002,113,536
3Aug 5, 2026 22:328,67281,893,08569,319,0002,659,0002,113,536
4Aug 5, 2026 22:328,68581,850,01969,498,0002,588,0002,113,536
5Aug 5, 2026 22:328,71282,153,74169,685,0002,632,0002,113,536
6Aug 5, 2026 22:328,72782,208,68669,858,0002,581,0002,113,536
7Aug 5, 2026 22:328,75382,469,54170,127,0002,531,0002,113,536
8Aug 5, 2026 22:328,77582,654,62170,161,0002,675,0002,113,536
9Aug 5, 2026 22:328,81282,938,51370,460,0002,685,0002,117,632