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 21:53Victor MerckléVictor MerckléScore: 3,854Success
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 21:543,83240,071,01130,725,0001,083,0002,113,536
2Aug 26, 2026 21:543,84040,168,36530,812,0001,065,0002,113,536
3Aug 26, 2026 21:543,84440,254,63730,848,0001,061,0002,113,536
4Aug 26, 2026 21:543,85241,074,08730,814,0001,162,0002,113,536
5Aug 26, 2026 21:543,85440,279,67230,925,0001,069,0002,113,536
6Aug 26, 2026 21:543,87340,477,57031,054,0001,097,0002,113,536
7Aug 26, 2026 21:543,89940,528,68731,191,0001,172,0002,113,536
8Aug 26, 2026 21:544,08642,164,54632,851,0001,068,0002,113,536
9Aug 26, 2026 21:544,14542,569,87733,341,0001,069,0002,113,536