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 09:40ZOTTIGZOTTIGScore: 100,328Success
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 09:4099,859854,638,759768,840,00059,987,0002,326,528
2Nov 11, 2024 09:4099,868853,078,949769,913,00058,993,0002,486,272
3Nov 11, 2024 09:4099,894855,809,414775,116,00054,008,0002,478,080
4Nov 11, 2024 09:40100,131864,747,560775,085,00056,006,0002,486,272
5Nov 11, 2024 09:40100,328857,499,405776,742,00055,981,0002,482,176
6Nov 11, 2024 09:40100,344856,250,647776,868,00055,990,0002,326,528
7Nov 11, 2024 09:40100,429859,272,505767,599,00065,965,0002,326,528
8Nov 11, 2024 09:40100,633881,376,935772,157,00063,094,0002,326,528
9Nov 11, 2024 09:40101,222868,854,420780,205,00059,938,0002,322,432