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 13, 2025 11:42pseppsepScore: 42,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2025 11:4242,065374,724,431348,142,0001,000,0002,371,584
2Dec 13, 2025 11:4242,071375,793,101348,189,0001,000,0002,375,680
3Dec 13, 2025 11:4242,097370,999,826348,408,0001,001,0002,519,040
4Dec 13, 2025 11:4242,105379,657,323347,468,0002,002,0002,510,848
5Dec 13, 2025 11:4242,119373,421,495348,593,000998,0002,396,160
6Dec 13, 2025 11:4242,137377,615,575346,742,0002,997,0002,510,848
7Dec 13, 2025 11:4242,141379,931,257348,770,000999,0002,510,848
8Dec 13, 2025 11:4242,150376,503,059347,844,0001,999,0002,383,872
9Dec 13, 2025 11:4242,156382,691,103347,893,0001,999,0002,519,040