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 17, 2026 14:21Kevin HeaveyKevin HeaveyScore: 3,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 14:393,66740,412,93529,387,0001,050,0002,113,536
2Jul 17, 2026 14:393,66840,324,76329,400,0001,049,0002,113,536
3Jul 17, 2026 14:393,70750,856,18629,729,0001,046,0002,113,536
4Jul 17, 2026 14:393,72350,281,34629,857,0001,050,0002,117,632
5Jul 17, 2026 14:393,88743,182,25231,244,0001,024,0002,113,536
6Jul 17, 2026 14:393,92142,341,00031,507,0001,043,0002,113,536
7Jul 17, 2026 14:393,92743,860,90531,552,0001,048,0002,113,536
8Jul 17, 2026 14:393,92742,402,99831,556,0001,045,0002,113,536
9Jul 17, 2026 14:393,98742,888,07732,075,0001,021,0002,113,536