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 28, 2026 19:15boop34boop34Score: 10,535Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2026 19:1610,18394,665,43776,359,0008,162,0002,113,536
2Jul 28, 2026 19:1610,33997,317,75974,550,00011,264,00020,480
3Jul 28, 2026 19:1610,426100,985,87876,162,00010,378,0002,113,536
4Jul 28, 2026 19:1610,46496,789,54674,670,00012,183,0002,113,536
5Jul 28, 2026 19:1610,53597,330,56576,021,00011,421,00020,480
6Jul 28, 2026 19:1610,60397,886,94678,856,0009,152,0002,113,536
7Jul 28, 2026 19:1610,64698,368,49878,111,00010,258,0002,113,536
8Jul 28, 2026 19:1610,67698,618,94778,377,00010,237,00020,480
9Jul 28, 2026 19:1610,72098,890,50375,754,00013,227,00020,480