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 10:53Victor MerckléVictor MerckléScore: 3,944Success
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 10:533,86240,441,27930,923,0001,138,0002,113,536
2Aug 27, 2026 10:533,86740,642,76030,973,0001,128,0002,113,536
3Aug 27, 2026 10:533,89740,771,46631,214,0001,139,0002,113,536
4Aug 27, 2026 10:533,90440,760,21831,351,0001,056,0002,113,536
5Aug 27, 2026 10:533,94441,104,04431,642,0001,100,0002,113,536
6Aug 27, 2026 10:533,95541,225,11531,681,0001,150,0002,113,536
7Aug 27, 2026 10:533,96742,454,78931,756,0001,173,0002,113,536
8Aug 27, 2026 10:534,04341,940,66932,448,0001,112,0002,113,536
9Aug 27, 2026 10:534,11342,831,02733,040,0001,105,0002,113,536