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 21, 2026 07:28Kevin HeaveyKevin HeaveyScore: 3,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 07:303,57339,412,34628,617,0001,045,0002,113,536
2Jul 21, 2026 07:303,57539,265,40228,631,0001,048,0002,113,536
3Jul 21, 2026 07:303,58439,414,76228,704,0001,047,0002,113,536
4Jul 21, 2026 07:303,58539,414,76728,709,0001,050,0002,113,536
5Jul 21, 2026 07:303,58839,465,45228,738,0001,047,0002,113,536
6Jul 21, 2026 07:303,58939,453,03028,734,0001,058,0002,113,536
7Jul 21, 2026 07:303,60542,012,75028,888,0001,039,0002,113,536
8Jul 21, 2026 07:303,61239,687,28028,935,0001,049,0002,113,536
9Jul 21, 2026 07:303,61639,696,25428,949,0001,064,0002,113,536