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 19:55Victor MerckléVictor MerckléScore: 3,805Success
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 19:553,73339,502,87429,852,0001,139,0002,117,632stderr
2Aug 26, 2026 19:553,76939,597,70530,166,0001,120,0002,117,632stderr
3Aug 26, 2026 19:553,77339,464,13530,250,0001,068,0002,117,632stderr
4Aug 26, 2026 19:553,80339,920,37330,407,0001,164,0002,117,632stderr
5Aug 26, 2026 19:553,80540,038,96530,480,0001,102,0002,117,632stderr
6Aug 26, 2026 19:553,84040,969,94330,754,0001,124,0002,117,632stderr
7Aug 26, 2026 19:553,87140,333,89531,034,0001,099,0002,117,632stderr
8Aug 26, 2026 19:554,00442,278,86932,157,0001,077,0002,117,632stderr
9Aug 26, 2026 19:554,02641,593,80032,349,0001,075,0002,117,632stderr