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 12, 2026 23:44Jarry XiaoJarry XiaoScore: 36,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 23:4536,445312,091,426300,437,0002,062,0002,129,920
2Jul 12, 2026 23:4536,464312,374,551300,525,0002,131,0002,129,920
3Jul 12, 2026 23:4536,465312,334,026300,531,0002,135,0002,129,920
4Jul 12, 2026 23:4536,467312,369,233301,680,0001,004,0002,129,920
5Jul 12, 2026 23:4536,471312,396,691300,573,0002,137,0002,129,920
6Jul 12, 2026 23:4536,474312,356,699301,733,0001,006,0002,129,920
7Jul 12, 2026 23:4536,483312,465,034301,807,0001,004,0002,129,920
8Jul 12, 2026 23:4536,484312,470,954300,705,0002,120,0002,129,920
9Jul 12, 2026 23:4536,951317,856,344304,555,0002,143,0002,129,920