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 listMar 1, 2026 09:03Benji WhiteBenji WhiteScore: 56,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2026 09:0356,592492,025,177467,713,0001,998,0002,265,088
2Mar 1, 2026 09:0356,602490,169,863468,800,000999,0002,269,184
3Mar 1, 2026 09:0356,603495,739,422468,806,000999,0002,289,664
4Mar 1, 2026 09:0356,610496,280,194467,863,0001,999,0002,285,568
5Mar 1, 2026 09:0356,613494,934,304467,889,0001,999,0002,293,760
6Mar 1, 2026 09:0356,619499,476,822468,937,000999,0002,285,568
7Mar 1, 2026 09:0356,619501,119,399468,938,000999,0002,281,472
8Mar 1, 2026 09:0356,629495,308,528468,023,0002,000,0002,285,568
9Mar 1, 2026 09:0356,643497,816,461468,137,0002,000,0002,269,184