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 24, 2024 02:12MatthiasMatthiasScore: 10,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2024 02:1210,650113,483,85486,390,0002,009,0002,260,992
2Nov 24, 2024 02:1210,660116,510,40287,475,0001,005,0002,289,664
3Nov 24, 2024 02:1210,664115,117,52187,510,0001,005,0002,285,568
4Nov 24, 2024 02:1210,665112,782,01488,523,00002,289,664
5Nov 24, 2024 02:1210,665114,906,37487,516,0001,005,0002,281,472
6Nov 24, 2024 02:1210,669117,083,87287,546,0001,006,0002,265,088
7Nov 24, 2024 02:1210,670118,747,86287,554,0001,006,0002,289,664
8Nov 24, 2024 02:1210,670114,165,11687,557,0001,006,0002,289,664
9Nov 24, 2024 02:1210,671119,179,63487,567,0001,006,0002,289,664
10Nov 24, 2024 02:1210,672115,001,63787,572,0001,006,0002,523,136
11Nov 24, 2024 02:1210,675119,704,81187,593,0001,006,0002,277,376
12Nov 24, 2024 02:1210,675118,879,38988,601,00002,281,472