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 6, 2026 22:06Joshua MontrossJoshua MontrossScore: 21,172Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:0721,116184,846,923174,114,0001,149,0002,113,536
2Jul 6, 2026 22:0721,139185,178,546174,283,0001,173,0002,113,536
3Jul 6, 2026 22:0721,149185,671,178174,290,0001,248,0002,113,536
4Jul 6, 2026 22:0721,150185,122,179174,314,0001,238,0002,113,536
5Jul 6, 2026 22:0721,172187,099,039174,729,0001,003,0002,113,536
6Jul 6, 2026 22:0721,213185,665,991174,834,0001,236,0002,113,536
7Jul 6, 2026 22:0721,224185,813,339175,117,0001,048,0002,113,536
8Jul 6, 2026 22:0721,243185,986,737175,178,0001,145,0002,113,536
9Jul 6, 2026 22:0721,634189,126,930178,414,0001,156,0002,113,536