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 17, 2026 17:09wnwnScore: 8,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 17:108,17092,618,84564,822,0002,991,0002,510,848
2Feb 17, 2026 17:108,22789,687,21865,274,0003,012,0002,359,296
3Feb 17, 2026 17:108,363101,824,91468,408,0001,006,0002,424,832