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 11, 2024 08:23Igor ZyginIgor ZyginScore: 325,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 08:23324,7872,721,638,5742,633,763,00061,970,0002,535,424
2Nov 11, 2024 08:24325,1502,728,999,3622,642,774,00055,974,0002,400,256
3Nov 11, 2024 08:24325,2232,731,251,9142,641,389,00057,964,0002,351,104
4Nov 11, 2024 08:23325,3072,729,051,0692,639,092,00060,955,0002,449,408
5Nov 11, 2024 08:23326,5992,741,063,5302,651,824,00058,951,0002,297,856
6Nov 11, 2024 08:24330,3202,765,234,3722,672,686,00068,966,0002,519,040