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 listMay 20, 2026 06:04M-RochatM-RochatScore: 13,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:0513,000118,444,879105,555,0002,351,0002,113,536
2May 20, 2026 06:0513,008119,027,420105,630,0002,342,0002,113,536
3May 20, 2026 06:0513,010119,418,500105,642,0002,348,0002,117,632
4May 20, 2026 06:0513,022118,105,848105,744,0002,345,0002,113,536
5May 20, 2026 06:0513,023118,244,580105,770,0002,327,0002,113,536
6May 20, 2026 06:0513,026120,457,861105,765,0002,354,0002,113,536
7May 20, 2026 06:0513,031118,557,350105,811,0002,349,0002,113,536
8May 20, 2026 06:0513,045118,436,108105,940,0002,341,0002,113,536
9May 20, 2026 06:0513,049119,465,491106,277,0002,036,0002,113,536