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 23, 2026 16:28satoru.netsatoru.netScore: 38,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 16:2838,269344,755,466315,632,0001,997,0002,277,376
2Feb 23, 2026 16:2838,295343,976,049316,853,000999,0002,277,376
3Feb 23, 2026 16:2838,305350,772,931316,935,000999,0002,277,376