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:51luckyhwanluckyhwanScore: 48,700Success
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:5148,689428,921,517403,117,0001,000,0002,256,896
2Dec 8, 2025 11:5148,694431,844,438402,159,0002,000,0002,256,896
3Dec 8, 2025 11:5148,700427,540,744404,212,00002,387,968
4Dec 8, 2025 11:5148,700431,712,480401,211,0003,001,0002,519,040
5Dec 8, 2025 11:5148,700425,798,001403,210,0001,000,0002,375,680
6Dec 8, 2025 11:5148,704426,846,047403,240,0001,000,0002,265,088
7Dec 8, 2025 11:5148,716428,755,732403,345,0001,000,0002,519,040
8Dec 8, 2025 11:5148,717427,651,768404,347,00002,510,848
9Dec 8, 2025 11:5148,720432,821,561404,373,00002,519,040