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 4, 2026 12:40Joel ChongJoel ChongScore: 62,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 12:4061,488520,525,953509,147,0001,210,0002,113,536
2Jul 4, 2026 12:4061,519520,210,617509,388,0001,227,0002,113,536
3Jul 4, 2026 12:4061,794522,582,672511,702,0001,191,0002,113,536
4Jul 4, 2026 12:4062,026524,466,509513,652,0001,166,0002,113,536
5Jul 4, 2026 12:4062,030524,503,982513,851,0001,005,0002,113,536
6Jul 4, 2026 12:4062,046524,637,494513,985,0001,002,0002,113,536
7Jul 4, 2026 12:4062,051525,190,158513,777,0001,249,0002,113,536
8Jul 4, 2026 12:4062,058524,686,310513,847,0001,236,0002,113,536
9Jul 4, 2026 12:4062,085525,333,821514,165,0001,147,0002,113,536