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:39zielajzielajScore: 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:393,75753,588,60929,174,0002,012,0002,371,584
2Nov 17, 2024 01:393,75852,068,98929,177,0002,012,0002,527,232
3Nov 17, 2024 01:393,76961,194,84829,265,0002,018,0002,379,776
4Nov 17, 2024 01:393,78058,005,97229,348,0002,024,0002,375,680
5Nov 17, 2024 01:393,78359,023,16730,387,0001,012,0002,392,064
6Nov 17, 2024 01:393,78959,287,36630,437,0001,014,0002,396,160