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 6, 2026 11:03Kevin HeaveyKevin HeaveyScore: 3,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:063,52937,543,07428,255,0001,038,0002,113,536
2Sep 6, 2026 11:063,53637,642,15928,313,0001,043,0002,113,536
3Sep 6, 2026 11:063,54237,667,92328,219,0001,183,0002,113,536
4Sep 6, 2026 11:063,54437,835,05028,381,0001,036,0002,113,536
5Sep 6, 2026 11:063,55437,827,66728,443,0001,061,0002,113,536
6Sep 6, 2026 11:063,56637,898,68328,565,0001,035,0002,113,536
7Sep 6, 2026 11:063,59238,166,11928,781,0001,035,0002,113,536
8Sep 6, 2026 11:063,77839,665,73030,148,0001,212,0002,113,536
9Sep 6, 2026 11:063,82840,090,20630,585,0001,190,0002,113,536