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 listSep 7, 2026 20:00Sai PutravuSai PutravuScore: 74,748Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 20:0074,415627,504,574613,302,0004,345,00020,480
2Sep 7, 2026 20:0074,704630,070,791615,864,0004,184,00020,480
3Sep 7, 2026 20:0074,735630,339,625615,771,0004,534,00020,480
4Sep 7, 2026 20:0074,742630,250,468615,713,0004,649,00020,480
5Sep 7, 2026 20:0074,748630,415,557615,644,0004,768,0002,113,536
6Sep 7, 2026 20:0074,748630,400,076615,854,0004,557,00020,480
7Sep 7, 2026 20:0074,750630,734,887615,722,0004,711,00020,480
8Sep 7, 2026 20:0074,767630,552,661615,827,0004,741,00020,480
9Sep 7, 2026 20:0074,804630,868,199615,858,0005,019,0002,113,536