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 30, 2026 22:12Josu San MartinJosu San MartinScore: 4,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 22:134,42045,130,51335,653,0001,036,0002,113,536
2Aug 30, 2026 22:134,42045,152,62535,655,0001,039,0002,113,536
3Aug 30, 2026 22:134,42545,168,68335,685,0001,044,0002,113,536
4Aug 30, 2026 22:134,42645,234,00135,707,0001,035,0002,113,536
5Aug 30, 2026 22:134,43645,296,98135,762,0001,064,0002,113,536
6Aug 30, 2026 22:134,43945,333,51335,736,0001,115,0002,113,536
7Aug 30, 2026 22:134,45845,429,07335,876,0001,127,0002,113,536
8Aug 30, 2026 22:134,57746,542,09436,956,0001,038,0002,113,536
9Aug 30, 2026 22:134,61946,921,96137,209,0001,131,0002,113,536