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 2, 2025 09:07Tan Lip WeiTan Lip WeiScore: 8,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 09:077,90195,041,89254,649,00010,929,0002,506,752
2Nov 2, 2025 09:077,911102,229,12152,731,00012,934,0002,306,048
3Nov 2, 2025 09:077,93395,006,97753,874,00011,972,0002,506,752
4Nov 2, 2025 09:078,42395,655,32258,925,00010,986,0002,375,680
5Nov 2, 2025 09:078,43498,697,02759,000,00011,000,0002,314,240
6Nov 2, 2025 09:078,44195,134,55661,055,0009,008,0002,269,184
7Nov 2, 2025 09:078,46599,792,67160,223,00010,037,0002,441,216
8Nov 2, 2025 09:078,47496,826,44859,284,00011,053,0002,314,240
9Nov 2, 2025 09:078,488101,541,97660,526,0009,922,0002,510,848
10Nov 2, 2025 09:078,501107,618,00559,625,00010,931,0002,310,144
11Nov 2, 2025 09:078,585107,471,60159,215,00012,043,0002,457,600
12Nov 2, 2025 09:078,631104,336,26858,701,00012,934,0002,424,832