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 10, 2026 09:49wnwnScore: 3,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 09:493,72844,958,79629,865,0001,084,0002,473,984
2May 10, 2026 09:493,85645,579,49830,955,0001,053,0002,478,080
3May 10, 2026 09:493,85747,398,57030,953,0001,064,0002,482,176
4May 10, 2026 09:493,88049,864,20831,120,0001,089,0002,482,176
5May 10, 2026 09:493,88045,542,23931,150,0001,060,0002,486,272
6May 10, 2026 09:493,89846,413,05831,309,0001,049,0002,490,368
7May 10, 2026 09:493,90546,636,85231,336,0001,077,0002,482,176
8May 10, 2026 09:493,91045,879,80131,374,0001,080,0002,486,272
9May 10, 2026 09:493,91849,747,53531,440,0001,086,0002,478,080