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 07:39Andrew EpsteinAndrew EpsteinScore: 13,120Success
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 07:3913,071117,778,517107,405,0001,086,0002,117,632stderr
2Nov 3, 2026 07:3913,104118,082,579107,629,0001,138,0002,117,632stderr
3Nov 3, 2026 07:3913,110118,492,820107,795,0001,023,00024,576stderr
4Nov 3, 2026 07:3913,112118,102,829107,644,0001,186,0002,117,632stderr
5Nov 3, 2026 07:3913,120118,205,610107,872,0001,031,00024,576stderr
6Nov 3, 2026 07:3913,169119,148,207108,269,0001,035,0002,117,632stderr
7Nov 3, 2026 07:3913,199119,382,762109,559,000024,576stderr
8Nov 3, 2026 07:3913,246119,249,293108,934,0001,011,00024,576stderr
9Nov 3, 2026 07:3913,286119,631,444109,125,0001,157,0002,117,632stderr