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 1, 2026 10:27Victor MerckléVictor MerckléScore: 4,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 10:284,36744,694,55935,141,0001,106,0002,117,632stderr
2Aug 1, 2026 10:284,37444,787,98835,195,0001,110,0002,117,632stderr
3Aug 1, 2026 10:284,38044,844,19235,241,0001,121,0002,117,632stderr
4Aug 1, 2026 10:284,38444,822,27135,282,0001,112,0002,117,632stderr
5Aug 1, 2026 10:284,38544,857,41435,289,0001,111,0002,117,632stderr
6Aug 1, 2026 10:284,40345,043,37435,446,0001,106,0002,117,632stderr
7Aug 1, 2026 10:284,42245,138,53335,647,0001,060,0002,117,632stderr
8Aug 1, 2026 10:284,44345,403,88335,786,0001,099,0002,117,632stderr
9Aug 1, 2026 10:284,47345,571,26435,994,0001,137,0002,117,632stderr