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 5, 2026 16:10Kevin HeaveyKevin HeaveyScore: 14,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 16:1113,979125,729,709112,918,0003,113,0002,117,632
2Jul 5, 2026 16:1114,011125,832,927113,232,0003,067,0002,117,632
3Jul 5, 2026 16:1114,229127,592,155115,036,0003,070,0002,117,632
4Jul 5, 2026 16:1114,453130,478,934116,952,0003,011,0002,117,632
5Jul 5, 2026 16:1114,463129,698,867117,034,0003,017,0002,117,632
6Jul 5, 2026 16:1114,669131,763,212118,596,0003,163,0002,117,632
7Jul 5, 2026 16:1114,684131,961,201118,764,0003,116,0002,117,632
8Jul 5, 2026 16:1114,743131,973,439119,248,0003,125,0002,117,632
9Jul 5, 2026 16:1114,895133,170,834120,539,0003,094,0002,117,632