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 listAug 27, 2026 16:58Victor MerckléVictor MerckléScore: 3,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 16:593,73939,209,10729,936,0001,103,0002,113,536
2Aug 27, 2026 16:593,75039,395,36229,977,0001,149,0002,113,536
3Aug 27, 2026 16:593,75039,360,42029,936,0001,196,0002,113,536
4Aug 27, 2026 16:593,75839,438,95330,114,0001,079,0002,113,536
5Aug 27, 2026 16:593,76339,465,12530,114,0001,120,0002,113,536
6Aug 27, 2026 16:593,76539,551,32830,160,0001,091,0002,113,536
7Aug 27, 2026 16:593,77339,450,03630,199,0001,123,0002,113,536
8Aug 27, 2026 16:593,77339,646,44130,224,0001,094,0002,113,536
9Aug 27, 2026 16:593,82540,132,89030,602,0001,150,0002,113,536