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 13, 2026 04:12mxzillimxzilliScore: 5,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2026 04:125,40855,592,08743,809,0001,084,0002,117,632
2Nov 13, 2026 04:125,41155,723,76743,825,0001,087,0002,117,632
3Nov 13, 2026 04:125,43655,902,27944,015,0001,107,0002,117,632
4Nov 13, 2026 04:125,47356,216,79144,337,0001,089,0002,117,632
5Nov 13, 2026 04:125,47856,200,54644,382,0001,087,0002,117,632
6Nov 13, 2026 04:125,48656,231,86944,443,0001,092,0002,117,632
7Nov 13, 2026 04:125,54456,806,27344,932,0001,087,0002,117,632
8Nov 13, 2026 04:125,57357,524,15845,167,0001,090,0002,117,632
9Nov 13, 2026 04:125,58957,116,35645,312,0001,080,0002,117,632