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:42luckyhwanluckyhwanScore: 52,697Success
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:4252,676469,709,154436,211,0001,000,0002,510,848
2Dec 8, 2025 11:4252,679457,185,093436,237,0001,000,0002,379,776
3Dec 8, 2025 11:4252,687458,568,437437,304,00002,510,848
4Dec 8, 2025 11:4252,687461,415,512436,300,0001,000,0002,256,896
5Dec 8, 2025 11:4252,697464,142,791437,386,00002,510,848
6Dec 8, 2025 11:4252,706464,590,896434,460,0003,003,0002,510,848
7Dec 8, 2025 11:4252,720463,505,816434,583,0002,997,0002,392,064
8Dec 8, 2025 11:4252,727462,225,283436,634,000999,0002,383,872
9Dec 8, 2025 11:4252,729470,796,832434,655,0002,997,0002,256,896