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 3, 2026 01:29Andrew EpsteinAndrew EpsteinScore: 34,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 01:3034,148292,753,134281,415,0002,015,0002,121,728stderr
2Nov 3, 2026 01:3034,156292,721,169281,488,0002,014,0002,121,728stderr
3Nov 3, 2026 01:3034,173292,919,820281,631,0002,012,0002,121,728stderr
4Nov 3, 2026 01:3034,258293,537,324282,327,0002,016,0002,121,728stderr
5Nov 3, 2026 01:3034,424294,972,480283,705,0002,016,0002,121,728stderr
6Nov 3, 2026 01:3034,529296,418,963284,567,0002,024,0002,121,728stderr
7Nov 3, 2026 01:3034,544296,075,020284,710,0002,013,0002,121,728stderr
8Nov 3, 2026 01:3034,609296,413,817285,248,0002,013,0002,121,728stderr
9Nov 3, 2026 01:3035,244310,537,278290,490,0002,036,0002,121,728stderr