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 2, 2026 23:07javivallejojavivallejoScore: 38,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 23:0738,324343,117,636317,091,0001,000,0002,494,464
2Feb 2, 2026 23:0738,342340,528,872317,241,0001,000,0002,277,376
3Feb 2, 2026 23:0738,363341,121,105317,410,0001,001,0002,498,560