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 listFeb 22, 2026 18:35wnwnScore: 5,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 18:355,03064,302,97239,765,0001,988,0002,486,272
2Feb 22, 2026 18:355,04068,604,55739,837,0001,991,0002,502,656
3Feb 22, 2026 18:359,156104,419,88773,998,0001,999,0002,494,464