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 21:12Josu San MartinJosu San MartinScore: 4,357Success
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 21:134,34244,526,97735,002,0001,043,0002,113,536
2Aug 30, 2026 21:134,34844,617,94135,059,0001,033,0002,113,536
3Aug 30, 2026 21:134,35344,592,17735,104,0001,031,0002,113,536
4Aug 30, 2026 21:134,35744,629,06135,121,0001,045,0002,113,536
5Aug 30, 2026 21:134,35744,635,08835,087,0001,078,0002,113,536
6Aug 30, 2026 21:134,36344,727,44835,124,0001,095,0002,113,536
7Aug 30, 2026 21:134,37044,812,58935,238,0001,041,0002,113,536
8Aug 30, 2026 21:134,37244,738,36935,269,0001,026,0002,113,536
9Aug 30, 2026 21:134,40245,089,72535,478,0001,059,0002,113,536