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 6, 2026 09:28Kevin HeaveyKevin HeaveyScore: 3,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 09:293,55939,561,43228,403,0001,142,0002,113,536
2Sep 6, 2026 09:293,57239,684,57028,607,0001,043,0002,113,536
3Sep 6, 2026 09:293,77641,363,99030,190,0001,152,0002,113,536
4Sep 6, 2026 09:293,79441,571,81230,329,0001,167,0002,113,536
5Sep 6, 2026 09:293,81741,683,05230,513,0001,174,0002,113,536
6Sep 6, 2026 09:293,84441,864,77530,761,0001,145,0002,113,536
7Sep 6, 2026 09:293,87042,424,54730,985,0001,143,0002,113,536
8Sep 6, 2026 09:293,89343,097,26331,168,0001,146,0002,113,536
9Sep 6, 2026 09:293,92042,557,11831,373,0001,171,0002,113,536