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 14:59George SeabridgeGeorge SeabridgeScore: 6,954Success
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 14:596,88468,706,27956,049,0001,095,0002,113,536
2Aug 1, 2026 14:596,88667,107,44256,142,0001,015,0002,113,536
3Aug 1, 2026 14:596,89467,187,17056,139,0001,087,0002,113,536
4Aug 1, 2026 14:596,91567,360,47056,312,0001,089,0002,113,536
5Aug 1, 2026 14:596,95467,714,82056,712,0001,007,0002,113,536
6Aug 1, 2026 14:598,12577,447,96566,349,0001,095,0002,113,536
7Aug 1, 2026 14:598,12777,472,09566,372,0001,087,0002,113,536
8Aug 1, 2026 14:598,14277,630,21866,492,0001,092,0002,113,536
9Aug 1, 2026 14:598,39179,653,92168,625,0001,025,0002,113,536