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 13, 2026 00:15Victor MerckléVictor MerckléScore: 4,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 00:164,51445,891,32436,445,0001,023,0002,117,632stderr
2Aug 13, 2026 00:164,52446,006,57736,525,0001,026,0002,117,632stderr
3Aug 13, 2026 00:164,52645,992,52436,554,0001,015,0002,117,632stderr
4Aug 13, 2026 00:164,52846,000,32836,477,0001,106,0002,117,632stderr
5Aug 13, 2026 00:164,53046,003,29636,583,0001,023,0002,117,632stderr
6Aug 13, 2026 00:164,53045,989,36436,578,0001,028,0002,117,632stderr
7Aug 13, 2026 00:164,53546,061,36036,539,0001,109,0002,117,632stderr
8Aug 13, 2026 00:164,54646,187,88936,683,0001,053,0002,117,632stderr
9Aug 13, 2026 00:164,61846,796,85437,207,0001,128,0002,117,632stderr