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 listMay 7, 2026 10:53wnwnScore: 3,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:533,36242,911,27626,844,0001,068,0002,486,272
2May 7, 2026 10:533,36843,988,71626,880,0001,076,0002,486,272
3May 7, 2026 10:533,37741,809,21426,988,0001,048,0002,486,272
4May 7, 2026 10:533,37943,793,52126,986,0001,060,0002,486,272
5May 7, 2026 10:533,39243,848,58527,085,0001,069,0002,473,984
6May 7, 2026 10:533,39447,073,86427,116,0001,058,0002,486,272
7May 7, 2026 10:533,41143,245,16927,239,0001,080,0002,490,368
8May 7, 2026 10:533,48745,233,26827,830,0001,113,0002,486,272
9May 7, 2026 10:533,59445,753,48828,789,0001,046,0002,486,272