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 30, 2026 19:57Josu San MartinJosu San MartinScore: 4,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:584,33844,395,60634,971,0001,042,0002,113,536
2Aug 30, 2026 19:584,35144,608,70634,996,0001,123,0002,113,536
3Aug 30, 2026 19:584,36144,670,36535,162,0001,037,0002,113,536
4Aug 30, 2026 19:584,36944,692,10635,213,0001,054,0002,113,536
5Aug 30, 2026 19:584,49445,749,82136,205,0001,103,0002,113,536
6Aug 30, 2026 19:584,51445,916,25336,436,0001,032,0002,113,536
7Aug 30, 2026 19:584,51946,065,44236,489,0001,021,0002,113,536
8Aug 30, 2026 19:584,53646,120,10936,548,0001,104,0002,113,536
9Aug 30, 2026 19:584,74847,805,90638,371,0001,041,0002,113,536