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 22, 2025 02:47Josu San MartinJosu San MartinScore: 43,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 02:4643,601382,200,044359,886,0001,999,0002,387,968
2Dec 22, 2025 02:4643,612393,619,476359,978,0001,999,0002,519,040
3Dec 22, 2025 02:4743,615390,391,946361,006,0001,000,0002,375,680
4Dec 22, 2025 02:4643,616390,774,496361,013,0001,000,0002,383,872
5Dec 22, 2025 02:4743,625389,232,094361,087,0001,000,0002,519,040
6Dec 22, 2025 02:4743,992387,644,784365,137,00002,383,872