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:07M-RochatM-RochatScore: 7,541Success
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:087,42771,138,31259,572,0002,077,0002,113,536
2May 20, 2026 10:087,51175,414,10260,185,0002,161,0002,113,536
3May 20, 2026 10:087,53872,182,52460,380,0002,189,0002,113,536
4May 20, 2026 10:087,53874,674,63360,376,0002,195,0002,113,536
5May 20, 2026 10:087,54173,783,27260,393,0002,199,0002,113,536
6May 20, 2026 10:087,54573,197,93660,429,0002,197,0002,113,536
7May 20, 2026 10:087,56672,839,31660,649,0002,154,0002,113,536
8May 20, 2026 10:087,56672,177,82260,622,0002,176,0002,113,536
9May 20, 2026 10:087,57273,290,64960,606,0002,247,0002,113,536