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 18:17Victor MerckléVictor MerckléScore: 3,868Success
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 18:183,83740,056,80330,734,0001,119,0002,113,536
2Aug 27, 2026 18:183,83740,132,92930,720,0001,130,0002,113,536
3Aug 27, 2026 18:183,84140,957,97030,781,0001,105,0002,113,536
4Aug 27, 2026 18:183,86541,014,11530,958,0001,123,0002,113,536
5Aug 27, 2026 18:183,86840,568,34731,033,0001,073,0002,113,536
6Aug 27, 2026 18:183,87040,419,07731,067,0001,060,0002,113,536
7Aug 27, 2026 18:183,89741,133,35731,182,0001,167,0002,113,536
8Aug 27, 2026 18:183,92540,756,66831,521,0001,062,0002,113,536
9Aug 27, 2026 18:184,10242,345,26832,923,0001,125,0002,113,536