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 21, 2026 13:10Victor MerckléVictor MerckléScore: 4,667Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:114,64948,633,74537,500,0001,088,0002,113,536
2May 21, 2026 13:114,65449,411,89837,553,0001,083,0002,113,536
3May 21, 2026 13:114,66148,495,43637,642,0001,046,0002,113,536
4May 21, 2026 13:114,66647,874,36437,707,0001,026,0002,113,536
5May 21, 2026 13:114,66747,167,24537,719,0001,023,0002,113,536
6May 21, 2026 13:114,66748,277,06937,725,0001,018,0002,113,536
7May 21, 2026 13:114,67347,046,88437,786,0001,003,0002,113,536
8May 21, 2026 13:114,67347,850,07837,765,0001,025,0002,113,536
9May 21, 2026 13:114,84950,230,48739,219,0001,031,0002,113,536