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 listJun 25, 2026 21:17Victor MerckléVictor MerckléScore: 9,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 21:189,42486,198,52777,103,0001,123,0002,113,536
2Jun 25, 2026 21:189,42485,796,64477,137,0001,089,0002,113,536
3Jun 25, 2026 21:189,42685,896,41177,142,0001,099,0002,113,536
4Jun 25, 2026 21:189,43485,932,32677,200,0001,110,0002,113,536
5Jun 25, 2026 21:189,43585,942,17177,195,0001,116,0002,113,536
6Jun 25, 2026 21:189,44686,174,04377,302,0001,103,0002,113,536
7Jun 25, 2026 21:189,44685,912,81777,350,0001,058,0002,113,536
8Jun 25, 2026 21:189,45086,078,66577,302,0001,134,0002,113,536
9Jun 25, 2026 21:189,47986,352,53877,659,0001,020,0002,113,536