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 20:25Kevin HeaveyKevin HeaveyScore: 5,286Success
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 20:265,23052,928,49942,165,0001,248,0002,117,632
2Jul 5, 2026 20:265,24353,134,54142,282,0001,235,0002,117,632
3Jul 5, 2026 20:265,24953,202,66442,313,0001,254,0002,117,632
4Jul 5, 2026 20:265,28453,446,50542,630,0001,231,0002,117,632
5Jul 5, 2026 20:265,28653,528,98442,598,0001,281,0002,117,632
6Jul 5, 2026 20:265,30853,633,75942,815,0001,244,0002,117,632
7Jul 5, 2026 20:265,31353,690,63542,849,0001,255,0002,117,632
8Jul 5, 2026 20:265,31953,716,66642,906,0001,243,0002,117,632
9Jul 5, 2026 20:265,35154,225,44342,326,0002,094,0002,117,632