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 listMar 13, 2026 15:15Dominique GarmierDominique GarmierScore: 11,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:1511,593119,960,10694,222,0002,004,0002,412,544
2Mar 13, 2026 15:1511,617121,232,35295,414,0001,004,0002,289,664
3Mar 13, 2026 15:1511,632127,174,50995,542,0001,005,0002,289,664
4Mar 13, 2026 15:1511,648124,331,50595,681,000996,0002,289,664
5Mar 13, 2026 15:1511,664128,507,10894,813,0001,996,0002,289,664
6Mar 13, 2026 15:1511,665130,983,89194,826,0001,996,0002,289,664
7Mar 13, 2026 15:1511,692124,628,79895,047,0002,000,0002,289,664
8Mar 13, 2026 15:1511,737123,090,72196,417,0001,004,0002,289,664
9Mar 13, 2026 15:1511,780124,067,24495,776,0001,995,0002,412,544