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 listApr 26, 2026 00:13zielajzielajScore: 3,447Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 00:133,39247,015,69027,149,0001,005,0002,424,832
2Apr 26, 2026 00:133,39647,659,45128,188,00002,420,736
3Apr 26, 2026 00:133,42545,891,61227,419,0001,015,0002,433,024
4Apr 26, 2026 00:133,43844,744,81427,519,0001,019,0002,420,736
5Apr 26, 2026 00:133,44749,754,56627,595,0001,022,0002,424,832
6Apr 26, 2026 00:133,44945,466,75527,611,0001,022,0002,416,640
7Apr 26, 2026 00:133,46142,777,48726,747,0001,981,0002,314,240
8Apr 26, 2026 00:133,57647,839,26728,663,0001,023,0002,306,048
9Apr 26, 2026 00:133,58545,442,07428,730,0001,026,0002,416,640