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 17, 2024 01:40zielajzielajScore: 3,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2024 01:403,67152,760,11229,457,0001,015,0002,392,064
2Nov 17, 2024 01:403,68455,095,21629,557,0001,019,0002,375,680
3Nov 17, 2024 01:403,68960,195,63430,616,00002,387,968
4Nov 17, 2024 01:403,78051,103,47230,363,0001,012,0002,392,064
5Nov 17, 2024 01:403,78653,591,02830,407,0001,013,0002,396,160
6Nov 17, 2024 01:403,94063,134,49931,681,0001,021,0002,392,064