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 14, 2024 03:57zielajzielajScore: 4,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 03:574,24356,715,65033,208,0002,012,0002,465,792
2Nov 14, 2024 03:574,24459,963,30334,216,0001,006,0002,523,136
3Nov 14, 2024 03:574,25160,127,04233,267,0002,016,0002,367,488
4Nov 14, 2024 03:574,92274,032,05639,853,000996,0002,527,232
5Nov 14, 2024 03:574,92463,194,77439,872,000996,0002,527,232
6Nov 14, 2024 03:574,95965,141,29340,153,0001,003,0002,379,776