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:12Kevin HeaveyKevin HeaveyScore: 3,845Success
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:133,57239,687,38528,468,0001,182,0002,113,536
2Sep 6, 2026 11:133,68940,618,90429,489,0001,134,0002,113,536
3Sep 6, 2026 11:133,71640,940,01229,800,0001,046,0002,113,536
4Sep 6, 2026 11:133,72940,978,91829,907,0001,048,0002,113,536
5Sep 6, 2026 11:133,84541,994,93230,764,0001,154,0002,113,536
6Sep 6, 2026 11:133,84742,747,21230,767,0001,165,0002,113,536
7Sep 6, 2026 11:133,85142,781,60030,826,0001,138,0002,113,536
8Sep 6, 2026 11:133,85742,043,29730,966,0001,048,0002,113,536
9Sep 6, 2026 11:133,85842,871,56830,866,0001,162,0002,113,536