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 12:18Victor MerckléVictor MerckléScore: 3,799Success
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:193,76440,241,70130,102,0001,145,0002,113,536
2Aug 27, 2026 12:193,79140,496,55330,342,0001,127,0002,113,536
3Aug 27, 2026 12:193,79240,496,15730,333,0001,143,0002,113,536
4Aug 27, 2026 12:193,79841,371,79830,355,0001,174,0002,113,536
5Aug 27, 2026 12:193,79939,879,12130,407,0001,132,0002,113,536
6Aug 27, 2026 12:193,82040,018,84630,580,0001,126,0002,113,536
7Aug 27, 2026 12:193,83540,863,64830,685,0001,146,0002,113,536
8Aug 27, 2026 12:193,84040,143,59030,806,0001,074,0002,113,536
9Aug 27, 2026 12:194,15043,440,87433,339,0001,114,0002,113,536