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 09:20Kevin 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 09:233,51437,443,11927,995,0001,176,0002,113,536
2Sep 6, 2026 09:233,53837,665,58928,292,0001,079,0002,113,536
3Sep 6, 2026 09:233,55137,755,13028,291,0001,190,0002,113,536
4Sep 6, 2026 09:233,55337,791,60328,309,0001,183,0002,113,536
5Sep 6, 2026 09:233,55437,775,48028,285,0001,217,0002,113,536
6Sep 6, 2026 09:233,57837,961,31728,497,0001,208,0002,113,536
7Sep 6, 2026 09:233,59938,215,28028,676,0001,201,0002,113,536
8Sep 6, 2026 09:233,64738,638,77529,079,0001,199,0002,113,536
9Sep 6, 2026 09:233,76939,610,31130,203,0001,083,0002,113,536