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 09:03Andrew EpsteinAndrew EpsteinScore: 101,432Success
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 09:04101,100848,423,318836,946,0002,186,0002,121,728stderr
2Nov 3, 2026 09:04101,353850,583,986839,193,0002,041,0002,121,728stderr
3Nov 3, 2026 09:04101,353850,521,756839,179,0002,055,0002,121,728stderr
4Nov 3, 2026 09:04101,377851,423,218838,180,0003,255,0002,121,728stderr
5Nov 3, 2026 09:04101,432851,427,076839,862,0002,031,0002,121,728stderr
6Nov 3, 2026 09:04101,440851,757,485839,929,0002,030,0002,121,728stderr
7Nov 3, 2026 09:04101,468851,529,255840,148,0002,044,0002,121,728stderr
8Nov 3, 2026 09:04101,478852,109,524840,247,0002,022,0002,121,728stderr
9Nov 3, 2026 09:04101,573852,913,317839,991,0003,068,0002,121,728stderr