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 05:29Andrew EpsteinAndrew EpsteinScore: 35,573Success
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 05:4135,473304,241,282288,342,0006,089,0002,121,728stderr
2Nov 3, 2026 05:4135,482304,567,463288,069,0006,433,0002,121,728stderr
3Nov 3, 2026 05:4135,483304,366,787287,913,0006,600,0002,121,728stderr
4Nov 3, 2026 05:4135,507304,010,263288,310,0006,406,0002,121,728stderr
5Nov 3, 2026 05:4135,573305,046,283288,822,0006,439,0002,121,728stderr
6Nov 3, 2026 05:4135,586304,636,495289,068,0006,303,0002,121,728stderr
7Nov 3, 2026 05:4135,666305,461,814289,592,0006,443,0002,121,728stderr
8Nov 3, 2026 05:4135,693305,469,110289,873,0006,384,0002,121,728stderr
9Nov 3, 2026 05:4135,989308,173,311292,174,0006,542,0002,121,728stderr