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 listSep 7, 2026 14:51Kevin PetersKevin PetersScore: 71,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:5271,580604,067,374537,916,00056,199,0002,113,536
2Sep 7, 2026 14:5271,598604,184,444537,921,00056,348,0002,113,536
3Sep 7, 2026 14:5271,621604,473,084538,236,00056,222,0002,113,536
4Sep 7, 2026 14:5271,634604,521,013538,324,00056,245,0002,113,536
5Sep 7, 2026 14:5271,649604,593,009538,441,00056,249,0002,113,536
6Sep 7, 2026 14:5271,657604,763,707538,536,00056,218,0002,113,536
7Sep 7, 2026 14:5271,678604,809,972538,664,00056,266,0002,113,536
8Sep 7, 2026 14:5271,685605,022,737537,791,00057,201,0002,113,536
9Sep 7, 2026 14:5271,729605,384,203538,158,00057,198,0002,113,536