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 listJul 6, 2026 10:04Teow Hua JunTeow Hua JunScore: 10,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 10:0510,47296,278,20384,983,0001,938,00020,480
2Jul 6, 2026 10:0510,50196,603,71284,983,0002,182,00020,480
3Jul 6, 2026 10:0510,52096,720,95284,128,0003,193,00020,480
4Jul 6, 2026 10:0510,54897,001,14984,345,0003,209,00020,480
5Jul 6, 2026 10:0510,57397,122,05184,004,0003,759,00020,480
6Jul 6, 2026 10:0510,57597,220,56683,937,0003,841,00020,480
7Jul 6, 2026 10:0510,59197,284,14283,989,0003,917,00020,480
8Jul 6, 2026 10:0510,62797,636,61984,240,0003,968,00020,480
9Jul 6, 2026 10:0510,63297,569,67484,392,0003,856,00020,480