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 listFeb 22, 2026 20:25wnwnScore: 4,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 20:254,38856,459,19635,407,0001,011,0002,490,368
2Feb 22, 2026 20:254,39158,950,37735,433,0001,012,0002,527,232
3Feb 22, 2026 20:254,41765,710,38435,647,0001,018,0002,490,368
4Feb 22, 2026 20:254,42165,541,58035,672,0001,019,0002,277,376
5Feb 22, 2026 20:254,44062,720,71034,858,0001,991,0002,494,464
6Feb 22, 2026 20:254,44262,223,82835,876,000996,0002,277,376
7Feb 22, 2026 20:254,44361,167,91934,888,0001,993,0002,277,376
8Feb 22, 2026 20:254,44659,861,34834,906,0001,994,0002,494,464
9Feb 22, 2026 20:254,47757,839,44535,152,0002,008,0002,498,560