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 listDec 8, 2025 11:48luckyhwanluckyhwanScore: 48,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:4848,703428,205,759403,232,0001,000,0002,510,848
2Dec 8, 2025 11:4848,705428,178,991402,251,0002,001,0002,256,896
3Dec 8, 2025 11:4848,708426,874,174402,278,0002,001,0002,510,848
4Dec 8, 2025 11:4848,709424,237,832403,286,0001,000,0002,396,160
5Dec 8, 2025 11:4848,709430,564,751402,284,0002,001,0002,260,992
6Dec 8, 2025 11:4848,712425,305,579403,309,0001,000,0002,519,040
7Dec 8, 2025 11:4848,730438,168,252403,454,0001,001,0002,510,848
8Dec 8, 2025 11:4848,730434,345,587402,461,0002,002,0002,392,064
9Dec 8, 2025 11:4848,751435,782,321403,632,000999,0002,510,848