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 09:59wnwnScore: 3,410Success
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:003,39246,401,88527,104,0001,050,0002,486,272
2May 7, 2026 10:003,39545,440,47927,108,0001,076,0002,473,984
3May 7, 2026 10:003,39844,539,99727,144,0001,062,0002,473,984
4May 7, 2026 10:003,40945,558,98827,197,0001,100,0002,490,368
5May 7, 2026 10:003,41045,585,79627,243,0001,063,0002,486,272
6May 7, 2026 10:003,43444,772,67527,372,0001,132,0002,494,464
7May 7, 2026 10:003,44544,004,25727,508,0001,090,0002,490,368
8May 7, 2026 10:003,58745,271,82128,713,0001,065,0002,490,368
9May 7, 2026 10:003,60345,095,82528,814,0001,092,0002,478,080