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 31, 2026 13:17George SeabridgeGeorge SeabridgeScore: 69,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 13:1767,987574,285,276563,191,0001,103,0002,117,632
2Jul 31, 2026 13:1768,233576,415,157565,127,0001,208,0002,117,632
3Jul 31, 2026 13:1768,289576,839,595565,658,0001,143,0002,117,632
4Jul 31, 2026 13:1769,350585,566,496574,415,0001,195,0002,117,632
5Jul 31, 2026 13:1769,443586,329,790575,234,0001,148,0002,117,632
6Jul 31, 2026 13:1769,484586,916,000575,582,0001,142,0002,117,632
7Jul 31, 2026 13:1769,636587,959,148576,837,0001,146,0002,117,632
8Jul 31, 2026 13:1769,750588,929,850577,787,0001,146,0002,117,632
9Jul 31, 2026 13:1769,933590,397,623579,174,0001,274,0002,117,632