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 10:28M-RochatM-RochatScore: 6,848Success
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 10:286,84268,980,45054,602,0002,188,0002,113,536
2May 20, 2026 10:286,84367,057,57954,659,0002,143,0002,113,536
3May 20, 2026 10:286,84566,404,11254,657,0002,157,0002,113,536
4May 20, 2026 10:286,84668,229,27854,672,0002,156,0002,113,536
5May 20, 2026 10:286,84866,530,30054,676,0002,168,0002,113,536
6May 20, 2026 10:286,84966,295,48154,671,0002,178,0002,113,536
7May 20, 2026 10:286,87366,845,89354,887,0002,166,0002,113,536
8May 20, 2026 10:286,88169,768,40554,917,0002,197,0002,113,536
9May 20, 2026 10:286,88367,118,77054,928,0002,203,0002,113,536