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 06:23M-RochatM-RochatScore: 12,794Success
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 06:2612,733116,823,195103,676,0002,012,0002,113,536
2May 20, 2026 06:2612,741116,524,405103,693,0002,060,0002,113,536
3May 20, 2026 06:2612,742116,468,745103,742,0002,023,0002,113,536
4May 20, 2026 06:2612,785116,326,483104,037,0002,086,0002,113,536
5May 20, 2026 06:2612,794121,582,217104,089,0002,104,0002,113,536
6May 20, 2026 06:2612,802118,539,554104,189,0002,068,0002,113,536
7May 20, 2026 06:2612,803117,859,764104,199,0002,067,0002,113,536
8May 20, 2026 06:2612,823116,808,655104,372,0002,063,0002,113,536
9May 20, 2026 06:2612,856117,335,233104,621,0002,086,0002,113,536