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 20:47Victor MerckléVictor MerckléScore: 5,662Success
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 20:485,63054,201,94045,618,0001,114,0002,113,536
2Jun 25, 2026 20:485,65154,383,17745,827,0001,082,0002,113,536
3Jun 25, 2026 20:485,65754,963,10045,808,0001,146,0002,113,536
4Jun 25, 2026 20:485,65954,658,71945,879,0001,095,0002,113,536
5Jun 25, 2026 20:485,66255,570,96945,942,0001,058,0002,113,536
6Jun 25, 2026 20:485,66754,543,30045,943,0001,096,0002,113,536
7Jun 25, 2026 20:485,68456,089,76746,171,0001,014,0002,113,536
8Jun 25, 2026 20:485,70754,915,27546,265,0001,104,0002,113,536
9Jun 25, 2026 20:485,73255,456,09546,496,0001,084,0002,113,536