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 19, 2026 17:20Adam FolwarcznyAdam FolwarcznyScore: 17,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 17:2017,561155,552,235144,744,0001,013,0002,113,536
2Jul 19, 2026 17:2017,570157,616,136144,832,0001,005,0002,113,536
3Jul 19, 2026 17:2017,579155,669,810144,902,0001,005,0002,113,536
4Jul 19, 2026 17:2017,593155,849,350145,020,0001,005,0002,113,536
5Jul 19, 2026 17:2017,615156,149,872145,203,0001,005,0002,113,536
6Jul 19, 2026 17:2017,620156,498,889145,243,0001,006,0002,113,536
7Jul 19, 2026 17:2017,621156,705,873145,247,0001,008,0002,113,536
8Jul 19, 2026 17:2017,775158,404,525146,528,0001,007,0002,113,536
9Jul 19, 2026 17:2018,273161,881,662150,666,0001,006,0002,113,536