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:48Kevin HeaveyKevin HeaveyScore: 3,683Success
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:493,53640,468,68428,266,0001,089,0002,113,536
2Sep 6, 2026 11:493,54739,318,54428,333,0001,115,0002,113,536
3Sep 6, 2026 11:493,55039,343,13028,346,0001,125,0002,113,536
4Sep 6, 2026 11:493,56339,455,08828,466,0001,114,0002,113,536
5Sep 6, 2026 11:493,68340,444,89429,448,0001,122,0002,113,536
6Sep 6, 2026 11:493,73140,879,35629,828,0001,146,0002,113,536
7Sep 6, 2026 11:493,76141,054,12430,109,0001,115,0002,113,536
8Sep 6, 2026 11:493,81941,589,46430,568,0001,130,0002,113,536
9Sep 6, 2026 11:493,85041,807,48130,722,0001,238,0002,113,536