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 listNov 8, 2025 22:23izotoffizotoffScore: 78,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 22:2378,943682,990,273654,230,0001,000,0002,318,336
2Nov 8, 2025 22:2378,963683,917,916654,392,000999,0002,318,336
3Nov 8, 2025 22:2378,973683,143,056653,478,0001,998,0002,318,336
4Nov 8, 2025 22:2378,976682,557,419654,502,000999,0002,424,832
5Nov 8, 2025 22:2378,977683,605,707654,508,000999,0002,318,336
6Nov 8, 2025 22:2378,977680,612,230651,516,0003,997,0002,428,928
7Nov 8, 2025 22:2378,979685,270,927653,528,0002,001,0002,318,336
8Nov 8, 2025 22:2379,004681,206,578652,734,0002,998,0002,420,736
9Nov 8, 2025 22:2379,031682,652,484651,957,0003,999,0002,424,832