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 21, 2026 21:18wnwnScore: 5,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 21:185,08863,971,41140,223,0002,011,0002,277,376
2Feb 21, 2026 21:185,12765,924,19541,545,0001,013,0002,277,376
3Feb 21, 2026 21:185,14668,071,33541,697,0001,017,0002,277,376