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 3, 2026 10:41RuszrokRuszrokScore: 220,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 10:41220,8561,861,019,9491,832,106,000999,0002,285,568
2Feb 3, 2026 10:41220,9191,859,093,3371,832,627,000999,0002,289,664
3Feb 3, 2026 10:41220,9571,858,222,7721,832,948,000999,0002,465,792
4Feb 3, 2026 10:41220,9621,864,118,9061,832,984,000999,0002,371,584
5Feb 3, 2026 10:41220,9681,861,917,6571,833,039,000999,0002,285,568
6Feb 3, 2026 10:41220,9811,858,571,7011,832,147,0001,999,0002,289,664
7Feb 3, 2026 10:41221,0181,858,549,5331,833,447,000999,0002,285,568
8Feb 3, 2026 10:41221,0981,864,287,0751,833,112,0001,999,0002,289,664
9Feb 3, 2026 10:41230,3011,933,104,6861,911,495,00002,351,104