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:59Kevin HeaveyKevin HeaveyScore: 3,546Success
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:013,50837,732,18727,908,0001,215,0002,113,536
2Sep 6, 2026 12:013,51739,244,72027,972,0001,224,0002,113,536
3Sep 6, 2026 12:013,54141,042,88128,309,0001,082,0002,113,536
4Sep 6, 2026 12:013,54339,278,44728,379,0001,035,0002,113,536
5Sep 6, 2026 12:013,54637,969,57028,231,0001,203,0002,113,536
6Sep 6, 2026 12:013,56037,966,53628,319,0001,234,0002,113,536
7Sep 6, 2026 12:013,56838,143,79128,588,0001,031,0002,113,536
8Sep 6, 2026 12:013,69640,583,09129,594,0001,089,0002,113,536
9Sep 6, 2026 12:013,71540,725,60029,795,0001,044,0002,113,536