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 01:48Victor MerckléVictor MerckléScore: 4,401Success
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 01:494,34944,475,23035,083,0001,016,0002,113,536
2Aug 27, 2026 01:494,38344,759,35635,330,0001,054,0002,113,536
3Aug 27, 2026 01:494,38544,771,44835,258,0001,141,0002,113,536
4Aug 27, 2026 01:494,39044,770,98735,314,0001,126,0002,113,536
5Aug 27, 2026 01:494,40146,063,74235,396,0001,136,0002,113,536
6Aug 27, 2026 01:494,43345,167,89835,660,0001,142,0002,113,536
7Aug 27, 2026 01:494,49345,663,31536,238,0001,062,0002,113,536
8Aug 27, 2026 01:494,51145,819,23236,305,0001,141,0002,113,536
9Aug 27, 2026 01:494,53546,019,64736,524,0001,121,0002,113,536