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 21:22Josu San MartinJosu San MartinScore: 4,266Success
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 21:224,26143,830,88234,337,0001,033,0002,113,536
2Aug 30, 2026 21:224,26143,791,29434,319,0001,050,0002,113,536
3Aug 30, 2026 21:224,26243,931,36334,327,0001,055,0002,113,536
4Aug 30, 2026 21:224,26643,836,66934,377,0001,034,0002,113,536
5Aug 30, 2026 21:224,26643,905,91234,380,0001,028,0002,113,536
6Aug 30, 2026 21:224,29444,113,32934,605,0001,042,0002,113,536
7Aug 30, 2026 21:224,30244,189,90134,680,0001,034,0002,113,536
8Aug 30, 2026 21:224,30344,146,79134,687,0001,031,0002,113,536
9Aug 30, 2026 21:224,32544,278,86034,867,0001,033,0002,113,536