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 19:34Josu San MartinJosu San MartinScore: 4,629Success
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 19:354,61746,744,25037,296,0001,027,0002,113,536
2Aug 30, 2026 19:354,62246,724,26637,340,0001,030,0002,113,536
3Aug 30, 2026 19:354,62648,079,67937,367,0001,034,0002,113,536
4Aug 30, 2026 19:354,62846,864,81237,386,0001,031,0002,113,536
5Aug 30, 2026 19:354,62946,791,60737,374,0001,050,0002,113,536
6Aug 30, 2026 19:354,63246,907,24837,436,0001,012,0002,113,536
7Aug 30, 2026 19:354,63446,868,09037,419,0001,045,0002,113,536
8Aug 30, 2026 19:354,64946,992,31637,479,0001,108,0002,113,536
9Aug 30, 2026 19:354,77248,008,91538,566,0001,047,0002,113,536