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 16, 2026 11:53marko1597marko1597Score: 10,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 11:5710,24095,016,43977,949,0007,045,0002,113,536
2Aug 16, 2026 11:5710,27995,297,51478,286,0007,037,0002,113,536
3Aug 16, 2026 11:5710,32895,768,96578,355,0007,375,0002,113,536
4Aug 16, 2026 11:5710,39296,334,83978,865,0007,396,0002,113,536
5Aug 16, 2026 11:5710,45197,471,47379,518,0007,227,0002,113,536
6Aug 16, 2026 11:5710,62898,358,16980,754,0007,465,0002,113,536
7Aug 16, 2026 11:5710,780100,211,49682,054,0007,422,0002,113,536
8Aug 16, 2026 11:5710,852100,123,62583,052,0007,020,0002,113,536
9Aug 16, 2026 11:5710,945101,063,77283,027,0007,818,0002,113,536