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:19ndbnndbnScore: 155,694Success
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:19155,5401,319,237,7371,204,987,00085,999,0002,486,272
2Nov 11, 2024 09:19155,5561,316,360,8141,206,176,00084,942,0002,273,280
3Nov 11, 2024 09:19155,6541,317,898,3721,194,007,00097,918,0002,281,472
4Nov 11, 2024 09:19155,6891,317,531,8981,207,269,00084,948,0002,281,472
5Nov 11, 2024 09:19155,6941,318,706,5721,201,310,00090,947,0002,281,472
6Nov 11, 2024 09:19155,7541,321,433,9631,198,775,00093,982,0002,281,472
7Nov 11, 2024 09:19155,7611,325,959,1311,207,826,00084,987,0002,281,472
8Nov 11, 2024 09:19155,8351,320,457,2081,208,467,00084,962,0002,281,472
9Nov 11, 2024 09:19156,6351,330,202,7461,221,188,00078,883,0002,273,280