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 12:03Kevin HeaveyKevin HeaveyScore: 3,540Success
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 12:053,50639,459,57028,027,0001,075,0002,113,536
2Sep 6, 2026 12:053,51839,330,40728,154,0001,047,0002,113,536
3Sep 6, 2026 12:053,53239,413,56328,281,0001,039,0002,113,536
4Sep 6, 2026 12:053,53338,972,72428,092,0001,236,0002,113,536
5Sep 6, 2026 12:053,54039,874,90328,309,0001,080,0002,113,536
6Sep 6, 2026 12:053,54537,774,06728,375,0001,050,0002,113,536
7Sep 6, 2026 12:053,54937,838,65528,258,0001,205,0002,113,536
8Sep 6, 2026 12:053,79143,688,02430,424,0001,045,0002,113,536
9Sep 6, 2026 12:053,82141,498,54230,684,0001,033,0002,113,536