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 6, 2026 07:46Kevin HeaveyKevin HeaveyScore: 4,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 07:474,62447,939,30437,130,0001,254,0002,117,632
2Jul 6, 2026 07:474,63758,602,86737,218,0001,270,0002,121,728
3Jul 6, 2026 07:474,65948,171,62137,498,0001,179,0002,117,632
4Jul 6, 2026 07:474,70248,695,50237,842,0001,190,0002,117,632
5Jul 6, 2026 07:474,75448,935,64638,223,0001,239,0002,117,632
6Jul 6, 2026 07:474,77449,143,17338,452,0001,176,0002,117,632
7Jul 6, 2026 07:474,91350,324,11339,612,0001,171,0002,117,632
8Jul 6, 2026 07:474,98150,804,82040,126,0001,223,0002,117,632
9Jul 6, 2026 07:475,27653,311,43842,780,0001,018,0002,117,632