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 7, 2026 19:07Kevin HeaveyKevin HeaveyScore: 9,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 19:079,74790,486,92179,792,0001,110,0002,117,632
2Jul 7, 2026 19:079,75090,551,93179,821,0001,108,0002,117,632
3Jul 7, 2026 19:079,75190,508,76179,820,0001,117,0002,117,632
4Jul 7, 2026 19:079,75290,518,95379,834,0001,113,0002,117,632
5Jul 7, 2026 19:079,75390,556,04079,827,0001,123,0002,117,632
6Jul 7, 2026 19:079,75790,777,18379,777,0001,208,0002,117,632
7Jul 7, 2026 19:079,75790,509,98179,882,0001,102,0002,117,632
8Jul 7, 2026 19:079,76090,511,23479,898,0001,110,0002,117,632
9Jul 7, 2026 19:079,96092,333,71781,655,0001,016,0002,117,632