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 24, 2026 13:31wnwnScore: 3,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 13:313,29036,009,90026,284,0001,030,0002,113,536
2Sep 24, 2026 13:313,30436,800,58426,403,0001,026,0002,113,536
3Sep 24, 2026 13:313,36836,640,08226,958,0001,004,0002,113,536
4Sep 24, 2026 13:313,39536,829,55327,175,0001,006,0002,113,536
5Sep 24, 2026 13:313,41836,993,32127,365,0001,008,0002,113,536
6Sep 24, 2026 13:313,43038,503,68827,467,0001,008,0002,113,536
7Sep 24, 2026 13:313,44237,244,91627,535,0001,034,0002,113,536
8Sep 24, 2026 13:313,47537,546,73427,739,0001,106,0002,113,536
9Sep 24, 2026 13:313,49537,768,45527,972,0001,039,0002,113,536