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 listApr 27, 2026 05:40wnwnScore: 3,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 05:403,42146,143,93527,387,0001,014,0002,490,368
2Apr 27, 2026 05:403,43042,778,63027,453,0001,016,0002,478,080
3Apr 27, 2026 05:403,44641,720,58427,582,0001,021,0002,486,272
4Apr 27, 2026 05:403,45145,677,46927,627,0001,023,0002,330,624
5Apr 27, 2026 05:403,47149,710,44126,828,0001,987,0002,490,368
6Apr 27, 2026 05:403,48244,111,49226,909,0001,993,0002,478,080
7Apr 27, 2026 05:403,50347,082,43527,076,0002,005,0002,478,080
8Apr 27, 2026 05:403,60752,216,28827,946,0001,996,0002,330,624
9Apr 27, 2026 05:403,60748,343,07627,944,0001,996,0002,494,464