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:16Josu San MartinJosu San MartinScore: 4,449Success
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:164,42345,115,47835,683,0001,030,0002,113,536
2Aug 30, 2026 21:164,44045,361,21935,755,0001,103,0002,113,536
3Aug 30, 2026 21:164,44345,365,62735,812,0001,067,0002,113,536
4Aug 30, 2026 21:164,44945,416,63035,890,0001,043,0002,113,536
5Aug 30, 2026 21:164,44945,356,44535,888,0001,042,0002,113,536
6Aug 30, 2026 21:164,45345,453,44735,922,0001,046,0002,113,536
7Aug 30, 2026 21:164,46545,631,56736,034,0001,033,0002,113,536
8Aug 30, 2026 21:164,46845,554,90536,050,0001,040,0002,113,536
9Aug 30, 2026 21:164,47645,626,01836,110,0001,045,0002,113,536