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 listJul 27, 2026 09:55boop34boop34Score: 38,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 09:5538,278327,861,755314,627,0003,084,0002,113,536
2Jul 27, 2026 09:5538,289328,572,093314,731,0003,071,00020,480
3Jul 27, 2026 09:5538,347328,421,202315,084,0003,203,00020,480
4Jul 27, 2026 09:5538,392328,881,771315,336,0003,318,00020,480
5Jul 27, 2026 09:5538,396328,819,689315,485,0003,207,0002,113,536
6Jul 27, 2026 09:5538,414328,978,552315,389,0003,450,0002,113,536
7Jul 27, 2026 09:5538,422329,071,250315,890,0003,015,0002,113,536
8Jul 27, 2026 09:5538,438329,578,979315,498,0003,545,00020,480
9Jul 27, 2026 09:5540,502346,404,819332,121,0004,051,00020,480