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 6, 2024 18:18bruHFTbruHFTScore: 170,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 18:18169,7651,432,553,0581,176,206,000232,842,0002,445,312
2Nov 6, 2024 18:18169,9861,439,617,4251,177,071,000233,815,0002,289,664
3Nov 6, 2024 18:18169,9951,438,273,5101,174,134,000236,825,0002,523,136
4Nov 6, 2024 18:18170,1591,435,167,7581,176,434,000235,886,0002,273,280
5Nov 6, 2024 18:18170,3001,435,939,7361,182,570,000230,916,0002,433,024
6Nov 6, 2024 18:18170,3261,443,140,4891,174,926,000238,781,0002,330,624
7Nov 6, 2024 18:18170,4801,436,460,3211,181,154,000233,832,0002,289,664
8Nov 6, 2024 18:18170,8141,448,578,5311,179,965,000237,791,0002,453,504
9Nov 6, 2024 18:18171,0211,447,644,7361,178,736,000240,742,0002,289,664