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 27, 2026 11:59Victor MerckléVictor MerckléScore: 3,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 12:003,72839,239,53529,740,0001,208,0002,113,536
2Aug 27, 2026 12:003,73240,050,53229,719,0001,258,0002,113,536
3Aug 27, 2026 12:003,73539,286,80929,778,0001,230,0002,113,536
4Aug 27, 2026 12:003,75239,346,43929,887,0001,262,0002,113,536
5Aug 27, 2026 12:003,76039,588,54030,025,0001,191,0002,113,536
6Aug 27, 2026 12:003,77239,698,38330,293,0001,018,0002,113,536
7Aug 27, 2026 12:003,77639,669,70030,309,0001,040,0002,113,536
8Aug 27, 2026 12:003,77639,648,78630,056,0001,285,0002,113,536
9Aug 27, 2026 12:003,93341,249,31131,454,0001,197,0002,113,536