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 10:22Kevin HeaveyKevin HeaveyScore: 3,810Success
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 10:233,57339,669,86628,435,0001,225,0002,113,536
2Sep 6, 2026 10:233,58439,775,04628,615,0001,135,0002,113,536
3Sep 6, 2026 10:233,63540,216,01629,153,0001,020,0002,113,536
4Sep 6, 2026 10:233,75241,223,05129,987,0001,162,0002,113,536
5Sep 6, 2026 10:233,81041,675,10030,484,0001,145,0002,113,536
6Sep 6, 2026 10:233,84041,916,00430,731,0001,149,0002,113,536
7Sep 6, 2026 10:233,87542,112,26331,125,0001,045,0002,113,536
8Sep 6, 2026 10:233,87642,215,72331,008,0001,164,0002,113,536
9Sep 6, 2026 10:233,88843,086,39831,087,0001,185,0002,113,536