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 22, 2026 07:10Victor MerckléVictor MerckléScore: 4,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 07:114,54747,696,07036,696,0001,051,0002,113,536
2May 22, 2026 07:114,55947,162,71636,782,0001,063,0002,113,536
3May 22, 2026 07:114,55947,224,09036,790,0001,053,0002,113,536
4May 22, 2026 07:114,56948,215,74136,853,0001,070,0002,113,536
5May 22, 2026 07:114,57547,695,17836,909,0001,067,0002,113,536
6May 22, 2026 07:114,57647,067,16436,947,0001,037,0002,113,536
7May 22, 2026 07:114,59045,991,52537,076,0001,021,0002,113,536
8May 22, 2026 07:114,76649,330,64038,561,0001,005,0002,113,536
9May 22, 2026 07:114,79749,257,19138,774,0001,049,0002,113,536