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:57Kevin HeaveyKevin HeaveyScore: 3,750Success
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:593,56339,629,68828,413,0001,168,0002,113,536
2Sep 6, 2026 11:593,56839,654,92528,481,0001,140,0002,113,536
3Sep 6, 2026 11:593,59739,825,87928,813,0001,047,0002,113,536
4Sep 6, 2026 11:593,60239,929,83028,740,0001,160,0002,113,536
5Sep 6, 2026 11:593,75041,173,01929,925,0001,205,0002,113,536
6Sep 6, 2026 11:593,81941,734,41830,564,0001,135,0002,113,536
7Sep 6, 2026 11:593,82141,743,19830,543,0001,178,0002,113,536
8Sep 6, 2026 11:593,86242,827,75631,016,0001,043,0002,113,536
9Sep 6, 2026 11:593,87642,247,24431,005,0001,170,0002,113,536