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 15, 2026 12:42Tomislav TunkovicTomislav TunkovicScore: 4,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 12:444,72547,719,05338,209,0001,010,00020,480
2Aug 15, 2026 12:444,73247,801,10638,265,0001,011,00020,480
3Aug 15, 2026 12:444,73247,783,07438,272,0001,010,00020,480
4Aug 15, 2026 12:444,73247,766,17938,273,0001,010,00020,480
5Aug 15, 2026 12:444,73347,689,60138,279,0001,010,00020,480
6Aug 15, 2026 12:444,73347,699,20438,281,0001,011,00020,480
7Aug 15, 2026 12:444,73647,797,10638,303,0001,010,00020,480
8Aug 15, 2026 12:444,74147,740,93538,342,0001,010,00020,480
9Aug 15, 2026 12:444,74147,757,36238,345,0001,013,00020,480