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 22, 2026 10:14wnwnScore: 3,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 10:153,46345,657,03726,768,0001,982,0002,486,272
2Apr 22, 2026 10:153,61345,679,42227,994,0001,999,0002,486,272
3Apr 22, 2026 10:153,63747,803,20929,183,0001,006,0002,478,080