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 listAug 27, 2026 01:50Victor MerckléVictor MerckléScore: 4,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 01:514,25943,768,63634,183,0001,167,0002,117,632stderr
2Aug 27, 2026 01:514,31544,150,33134,653,0001,163,0002,117,632stderr
3Aug 27, 2026 01:514,32144,246,85134,795,0001,071,0002,117,632stderr
4Aug 27, 2026 01:514,33044,401,03634,915,0001,028,0002,117,632stderr
5Aug 27, 2026 01:514,33745,066,76534,987,0001,015,0002,117,632stderr
6Aug 27, 2026 01:514,33844,418,24534,851,0001,161,0002,117,632stderr
7Aug 27, 2026 01:514,39644,922,81935,465,0001,022,0002,117,632stderr
8Aug 27, 2026 01:514,40244,954,21735,531,0001,011,0002,117,632stderr
9Aug 27, 2026 01:514,52745,896,44936,415,0001,165,0002,117,632stderr