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 11, 2026 19:22Victor MerckléVictor MerckléScore: 3,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 19:223,86340,473,90431,055,0001,016,0002,117,632stderr
2Aug 11, 2026 19:223,87941,785,46131,051,0001,145,0002,117,632stderr
3Aug 11, 2026 19:223,88940,695,54731,264,0001,018,0002,117,632stderr
4Aug 11, 2026 19:223,89640,732,44631,196,0001,144,0002,117,632stderr
5Aug 11, 2026 19:223,89740,733,88431,313,0001,036,0002,117,632stderr
6Aug 11, 2026 19:223,89840,749,65031,280,0001,075,0002,117,632stderr
7Aug 11, 2026 19:223,90240,808,93131,232,0001,156,0002,117,632stderr
8Aug 11, 2026 19:223,90640,733,82931,397,0001,029,0002,117,632stderr
9Aug 11, 2026 19:223,99641,620,11432,126,0001,041,0002,117,632stderr