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 listSep 7, 2026 15:01Kevin PetersKevin PetersScore: 70,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:0270,637596,202,415532,931,00053,363,0002,113,536
2Sep 7, 2026 15:0270,724596,987,712532,767,00054,245,0002,113,536
3Sep 7, 2026 15:0270,728596,987,483533,803,00053,243,0002,113,536
4Sep 7, 2026 15:0270,750597,188,159532,958,00054,274,0002,113,536
5Sep 7, 2026 15:0270,751597,204,726532,892,00054,342,0002,113,536
6Sep 7, 2026 15:0270,751597,294,279533,978,00053,257,0002,113,536
7Sep 7, 2026 15:0270,783597,547,581533,212,00054,287,0002,113,536
8Sep 7, 2026 15:0270,831597,867,550533,562,00054,340,0002,113,536
9Sep 7, 2026 15:0270,839597,809,354533,649,00054,318,0002,113,536