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:20Victor MerckléVictor MerckléScore: 3,755Success
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:203,71638,975,83229,698,0001,152,0002,113,536
2Aug 27, 2026 01:203,71639,120,09129,693,0001,150,0002,113,536
3Aug 27, 2026 01:203,73839,170,36829,860,0001,169,0002,113,536
4Aug 27, 2026 01:203,75039,323,53029,987,0001,144,0002,113,536
5Aug 27, 2026 01:203,75539,483,28630,027,0001,146,0002,113,536
6Aug 27, 2026 01:203,75739,565,05330,099,0001,087,0002,113,536
7Aug 27, 2026 01:203,77239,581,30930,218,0001,095,0002,113,536
8Aug 27, 2026 01:203,78139,754,26730,241,0001,144,0002,113,536
9Aug 27, 2026 01:203,95341,067,21531,711,0001,104,0002,113,536