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 listJan 5, 2026 20:40lipapipalipapipaScore: 68,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 20:4068,838596,637,540506,426,00064,926,000307,200
2Jan 5, 2026 20:4068,858602,616,298505,575,00065,944,0002,416,640
3Jan 5, 2026 20:4068,882598,967,229507,750,00063,968,000307,200
4Jan 5, 2026 20:4068,885597,331,555512,770,00058,973,000307,200
5Jan 5, 2026 20:4068,905600,813,062507,038,00064,876,000299,008
6Jan 5, 2026 20:4068,911596,255,794508,969,00062,996,000311,296
7Jan 5, 2026 20:4068,933604,032,949511,127,00061,015,0002,408,448
8Jan 5, 2026 20:4068,941601,381,608510,191,00062,023,0002,412,544
9Jan 5, 2026 20:4069,036601,375,804512,000,00061,000,000307,200