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 26, 2026 23:04Victor MerckléVictor MerckléScore: 3,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:043,75440,248,40429,947,0001,216,0002,117,632stderr
2Aug 26, 2026 23:043,76839,675,17730,157,0001,119,0002,117,632stderr
3Aug 26, 2026 23:043,77040,372,77830,139,0001,157,0002,117,632stderr
4Aug 26, 2026 23:043,77539,458,28530,192,0001,146,0002,117,632stderr
5Aug 26, 2026 23:043,78840,431,46630,347,0001,094,0002,117,632stderr
6Aug 26, 2026 23:043,79140,567,04330,340,0001,129,0002,117,632stderr
7Aug 26, 2026 23:043,80740,012,98430,488,0001,118,0002,117,632stderr
8Aug 26, 2026 23:043,81440,039,77830,589,0001,069,0002,117,632stderr
9Aug 26, 2026 23:044,06441,896,87732,631,0001,101,0002,117,632stderr