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:21Kevin HeaveyKevin HeaveyScore: 3,762Success
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:223,56339,538,94928,427,0001,146,0002,113,536
2Sep 6, 2026 11:223,57739,612,49828,554,0001,139,0002,113,536
3Sep 6, 2026 11:223,58239,764,52828,521,0001,215,0002,113,536
4Sep 6, 2026 11:223,73441,074,31729,832,0001,166,0002,113,536
5Sep 6, 2026 11:223,76241,202,57730,067,0001,159,0002,113,536
6Sep 6, 2026 11:223,79741,497,54730,360,0001,161,0002,113,536
7Sep 6, 2026 11:223,81341,786,73330,500,0001,151,0002,113,536
8Sep 6, 2026 11:223,84741,965,97330,784,0001,150,0002,113,536
9Sep 6, 2026 11:223,86142,834,33530,894,0001,154,0002,113,536