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, 2024 12:49zielajzielajScore: 16,576Success
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, 2024 12:4716,565161,667,722136,490,0001,003,0002,273,280
2Nov 3, 2024 12:4716,568166,617,268137,516,00002,428,928
3Nov 3, 2024 12:4716,570161,101,656136,526,0001,003,0002,273,280
4Nov 3, 2024 12:4716,573164,038,557137,555,00002,523,136
5Nov 3, 2024 12:4716,574160,268,225137,564,00002,428,928
6Nov 3, 2024 12:4716,574169,074,095137,568,00002,535,424
7Nov 3, 2024 12:4716,576165,244,530137,584,00002,273,280
8Nov 3, 2024 12:4716,579164,851,629136,604,0001,004,0002,437,120
9Nov 3, 2024 12:4716,579164,404,934136,598,0001,004,0002,424,832
10Nov 3, 2024 12:4916,677160,685,112138,420,00002,433,024
11Nov 3, 2024 12:4916,683159,915,167137,470,0001,003,0002,433,024
12Nov 3, 2024 12:4916,686163,156,474137,488,0001,003,0002,433,024