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 listAug 26, 2023 08:09Ignas BagdonasIgnas BagdonasScore: 18,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2023 08:0918,625182,458,238154,588,00002,457,600
2Aug 26, 2023 08:0918,652184,720,647153,815,000998,0002,445,312
3Aug 26, 2023 08:0918,689218,345,479155,119,88802,187,264
4Aug 26, 2023 08:0918,781177,983,166152,889,0002,997,0002,527,232
5Aug 26, 2023 08:0918,794176,956,944154,990,000999,0002,441,216
6Aug 26, 2023 08:0918,795180,154,181150,996,0004,999,0002,523,136
7Aug 26, 2023 08:0918,829178,223,832155,277,0001,001,0002,527,232
8Aug 26, 2023 08:0918,850180,803,464156,456,00002,527,232
9Aug 26, 2023 08:0918,970183,235,612157,455,00002,523,136
10Aug 26, 2023 08:0918,982180,731,251157,547,00002,453,504
11Aug 26, 2023 08:0918,985209,421,811157,572,72902,199,552
12Aug 26, 2023 08:0919,055233,885,167158,154,17002,195,456