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 17, 2026 19:15Kevin HeaveyKevin HeaveyScore: 3,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 19:333,71640,666,51929,797,0001,048,0002,113,536
2Jul 17, 2026 19:333,73840,858,36129,839,0001,190,0002,113,536
3Jul 17, 2026 19:333,76341,056,45330,191,0001,047,0002,113,536
4Jul 17, 2026 19:333,93642,522,57031,628,0001,044,0002,113,536
5Jul 17, 2026 19:333,94643,241,58931,714,0001,042,0002,113,536
6Jul 17, 2026 19:333,98142,908,07832,002,0001,044,0002,113,536
7Jul 17, 2026 19:333,99543,018,05532,123,0001,041,0002,113,536
8Jul 17, 2026 19:334,01743,164,78432,286,0001,061,0002,113,536
9Jul 17, 2026 19:334,02743,248,62732,387,0001,044,0002,113,536