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 8, 2025 23:15izotoffizotoffScore: 60,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 23:1560,592531,174,230500,911,0001,999,0002,506,752
2Nov 8, 2025 23:1560,594530,695,700498,932,0003,999,0002,514,944
3Nov 8, 2025 23:1560,596529,440,970500,947,0001,999,0002,543,616
4Nov 8, 2025 23:1560,598528,650,135498,962,0003,999,0002,543,616
5Nov 8, 2025 23:1560,598527,866,143501,968,000999,0002,498,560
6Nov 8, 2025 23:1560,601527,948,088501,992,000999,0002,539,520
7Nov 8, 2025 23:1560,602526,256,458501,998,000999,0002,543,616
8Nov 8, 2025 23:1560,622528,262,986501,161,0002,000,0002,502,656
9Nov 8, 2025 23:1560,632528,659,550501,248,0002,000,0002,543,616