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 12, 2026 05:15Victor MerckléVictor MerckléScore: 4,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 05:164,17642,868,58433,565,0001,097,0002,117,632stderr
2Aug 12, 2026 05:164,21843,216,56933,908,0001,104,0002,117,632stderr
3Aug 12, 2026 05:164,22643,508,83633,958,0001,124,0002,117,632stderr
4Aug 12, 2026 05:164,23043,541,32434,004,0001,112,0002,117,632stderr
5Aug 12, 2026 05:164,23843,387,11133,899,0001,278,0002,117,632stderr
6Aug 12, 2026 05:164,25943,517,42234,221,0001,132,0002,117,632stderr
7Aug 12, 2026 05:164,27143,647,78634,320,0001,132,0002,117,632stderr
8Aug 12, 2026 05:164,27143,910,26034,357,0001,096,0002,117,632stderr
9Aug 12, 2026 05:164,38044,724,14935,298,0001,058,0002,117,632stderr