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 23, 2026 02:01Kevin HeaveyKevin HeaveyScore: 4,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 02:013,92342,371,30730,548,0002,019,0002,113,536
2Jul 23, 2026 02:013,99042,831,02031,112,0002,009,0002,113,536
3Jul 23, 2026 02:014,00142,916,41731,173,0002,042,0002,113,536
4Jul 23, 2026 02:014,02343,148,78331,251,0002,140,0002,113,536
5Jul 23, 2026 02:014,02443,106,86431,206,0002,198,0002,113,536
6Jul 23, 2026 02:014,02943,198,56831,398,0002,045,0002,113,536
7Jul 23, 2026 02:014,04043,257,15731,506,0002,030,0002,113,536
8Jul 23, 2026 02:014,04743,353,71131,510,0002,087,0002,113,536
9Jul 23, 2026 02:014,05543,359,06031,532,0002,126,0002,113,536