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 listAug 2, 2026 14:57TonyTonyScore: 20,549Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 14:5820,330179,468,866156,560,00012,180,0002,113,536
2Aug 2, 2026 14:5820,431179,399,706157,043,00012,542,0002,113,536
3Aug 2, 2026 14:5820,431179,412,320157,465,00012,118,0002,113,536
4Aug 2, 2026 14:5820,488180,237,204157,619,00012,439,0002,113,536
5Aug 2, 2026 14:5820,549180,340,526158,012,00012,545,0002,113,536
6Aug 2, 2026 14:5820,584180,653,092158,943,00011,907,0002,113,536
7Aug 2, 2026 14:5820,587180,821,232158,470,00012,409,0002,113,536
8Aug 2, 2026 14:5820,615181,071,772158,514,00012,595,0002,113,536
9Aug 2, 2026 14:5820,626180,959,737158,175,00013,027,0002,113,536