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 26, 2026 15:04TudyMTudyMScore: 33,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 15:0533,828299,781,887277,777,0002,997,0002,379,776
2Apr 26, 2026 15:0533,829299,828,363277,786,0002,997,0002,379,776
3Apr 26, 2026 15:0533,830295,446,160278,792,0001,998,0002,387,968
4Apr 26, 2026 15:0533,835302,002,005279,833,000999,0002,383,872
5Apr 26, 2026 15:0533,846298,283,908278,923,0001,999,0002,301,952
6Apr 26, 2026 15:0533,852300,821,346277,978,0002,999,0002,379,776
7Apr 26, 2026 15:0533,855295,881,001277,998,0002,999,0002,387,968
8Apr 26, 2026 15:0533,858296,769,748280,027,0001,000,0002,318,336
9Apr 26, 2026 15:0533,869299,338,260280,113,0001,000,0002,387,968