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 listSep 14, 2026 00:18drewbumpasdrewbumpasScore: 62,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:1861,922524,899,401423,392,00090,564,0002,113,536
2Sep 14, 2026 00:1861,981524,674,308423,480,00090,970,0002,113,536
3Sep 14, 2026 00:1862,151525,986,194423,451,00092,410,0002,113,536
4Sep 14, 2026 00:1862,162526,143,907423,413,00092,539,0002,113,536
5Sep 14, 2026 00:1862,190526,395,574423,728,00092,455,0002,113,536
6Sep 14, 2026 00:1862,195526,448,311423,657,00092,562,0002,113,536
7Sep 14, 2026 00:1862,200526,585,565423,599,00092,663,0002,113,536
8Sep 14, 2026 00:1862,260526,928,344423,542,00093,220,0002,113,536
9Sep 14, 2026 00:1862,261527,686,020423,664,00093,107,0002,113,536