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 22, 2026 21:04Kevin HeaveyKevin HeaveyScore: 57,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 21:0656,437481,255,522467,432,0001,002,0002,113,536
2Jul 22, 2026 21:0657,246485,025,256474,147,0001,003,0002,113,536
3Jul 22, 2026 21:0657,592487,978,473477,014,0001,005,0002,113,536
4Jul 22, 2026 21:0657,617488,041,174477,218,0001,007,0002,113,536
5Jul 22, 2026 21:0657,950496,586,149479,988,0001,003,0002,113,536
6Jul 22, 2026 21:0658,378494,452,220483,535,0001,008,0002,113,536
7Jul 22, 2026 21:0659,786506,207,200495,228,0001,004,0002,113,536
8Jul 22, 2026 21:0659,923507,333,909496,364,0001,003,0002,113,536
9Jul 22, 2026 21:0665,054549,953,936538,947,0001,002,0002,113,536