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 listDec 6, 2025 10:44Rajarshi BasuRajarshi BasuScore: 6,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 10:446,80682,329,68954,469,0002,017,0002,289,664
2Dec 6, 2025 10:446,80779,812,16956,496,00002,273,280
3Dec 6, 2025 10:446,81387,517,24055,543,0001,009,0002,281,472
4Dec 6, 2025 10:446,81782,113,78355,570,0001,010,0002,281,472
5Dec 6, 2025 10:446,81882,479,64155,577,0001,010,0002,289,664
6Dec 6, 2025 10:446,81883,990,27555,581,0001,010,0002,289,664
7Dec 6, 2025 10:446,82184,899,36956,613,00002,289,664
8Dec 6, 2025 10:446,82184,748,01656,615,00002,289,664
9Dec 6, 2025 10:446,82184,656,82854,626,0001,986,0002,289,664
10Dec 6, 2025 10:446,96383,970,64855,797,0001,992,0002,265,088
11Dec 6, 2025 10:446,96382,163,94355,797,0001,992,0002,289,664
12Dec 6, 2025 10:446,96787,317,63255,832,0001,994,0002,289,664