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 11, 2026 19:39Tim ZhamoidinTim ZhamoidinScore: 81,515Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 19:3981,487703,194,536674,346,0001,998,0002,404,352
2Apr 11, 2026 19:3981,503701,448,732674,478,0001,998,0002,404,352
3Apr 11, 2026 19:3981,505699,985,200674,492,0001,998,0002,273,280
4Apr 11, 2026 19:3981,505708,148,469674,497,0001,998,0002,273,280
5Apr 11, 2026 19:3981,515710,044,114675,576,000999,0002,392,064
6Apr 11, 2026 19:3981,518701,013,566674,604,0001,998,0002,281,472
7Apr 11, 2026 19:3981,534704,302,953675,730,000999,0002,400,256
8Apr 11, 2026 19:3981,537708,596,157674,760,0001,999,0002,273,280
9Apr 11, 2026 19:3981,570703,978,199676,030,0001,000,0002,281,472